/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/loops/vogal-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7968f31 [2022-03-17 14:42:31,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-17 14:42:31,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-17 14:42:31,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-17 14:42:31,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-17 14:42:31,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-17 14:42:31,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-17 14:42:31,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-17 14:42:31,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-17 14:42:31,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-17 14:42:31,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-17 14:42:31,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-17 14:42:31,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-17 14:42:31,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-17 14:42:31,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-17 14:42:31,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-17 14:42:31,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-17 14:42:31,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-17 14:42:31,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-17 14:42:31,741 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-17 14:42:31,742 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-17 14:42:31,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-17 14:42:31,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-17 14:42:31,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-17 14:42:31,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-17 14:42:31,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-17 14:42:31,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-17 14:42:31,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-17 14:42:31,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-17 14:42:31,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-17 14:42:31,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-17 14:42:31,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-17 14:42:31,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-17 14:42:31,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-17 14:42:31,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-17 14:42:31,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-17 14:42:31,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-17 14:42:31,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-17 14:42:31,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-17 14:42:31,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-17 14:42:31,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-17 14:42:31,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-17 14:42:31,760 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-17 14:42:31,769 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-17 14:42:31,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-17 14:42:31,771 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-17 14:42:31,772 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-17 14:42:31,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-17 14:42:31,772 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-17 14:42:31,772 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-17 14:42:31,772 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-17 14:42:31,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-17 14:42:31,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-17 14:42:31,773 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-17 14:42:31,773 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-17 14:42:31,774 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-17 14:42:31,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-17 14:42:31,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-17 14:42:31,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-17 14:42:31,774 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-17 14:42:31,774 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-17 14:42:31,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 14:42:31,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-17 14:42:31,775 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-17 14:42:31,776 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-17 14:42:31,776 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-03-17 14:42:31,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-17 14:42:31,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-17 14:42:31,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-17 14:42:31,991 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-17 14:42:31,992 INFO L275 PluginConnector]: CDTParser initialized [2022-03-17 14:42:31,993 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/vogal-2.i [2022-03-17 14:42:32,030 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3afdcd046/7ea2dacffd7a43afbb1b4dba743bef55/FLAG35e521c1a [2022-03-17 14:42:32,406 INFO L306 CDTParser]: Found 1 translation units. [2022-03-17 14:42:32,406 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal-2.i [2022-03-17 14:42:32,410 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3afdcd046/7ea2dacffd7a43afbb1b4dba743bef55/FLAG35e521c1a [2022-03-17 14:42:32,419 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3afdcd046/7ea2dacffd7a43afbb1b4dba743bef55 [2022-03-17 14:42:32,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-17 14:42:32,422 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-17 14:42:32,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-17 14:42:32,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-17 14:42:32,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-17 14:42:32,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:42:32" (1/1) ... [2022-03-17 14:42:32,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24411645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:32, skipping insertion in model container [2022-03-17 14:42:32,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:42:32" (1/1) ... [2022-03-17 14:42:32,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-17 14:42:32,450 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-17 14:42:32,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal-2.i[808,821] [2022-03-17 14:42:32,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 14:42:32,597 INFO L203 MainTranslator]: Completed pre-run [2022-03-17 14:42:32,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal-2.i[808,821] [2022-03-17 14:42:32,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 14:42:32,630 INFO L208 MainTranslator]: Completed translation [2022-03-17 14:42:32,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:32 WrapperNode [2022-03-17 14:42:32,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-17 14:42:32,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-17 14:42:32,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-17 14:42:32,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-17 14:42:32,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:32" (1/1) ... [2022-03-17 14:42:32,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:32" (1/1) ... [2022-03-17 14:42:32,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:32" (1/1) ... [2022-03-17 14:42:32,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:32" (1/1) ... [2022-03-17 14:42:32,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:32" (1/1) ... [2022-03-17 14:42:32,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:32" (1/1) ... [2022-03-17 14:42:32,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:32" (1/1) ... [2022-03-17 14:42:32,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-17 14:42:32,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-17 14:42:32,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-17 14:42:32,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-17 14:42:32,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:32" (1/1) ... [2022-03-17 14:42:32,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 14:42:32,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 14:42:32,715 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-03-17 14:42:32,716 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-03-17 14:42:32,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-17 14:42:32,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-17 14:42:32,744 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-17 14:42:32,744 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-17 14:42:32,744 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-17 14:42:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-17 14:42:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-17 14:42:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-03-17 14:42:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-03-17 14:42:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-17 14:42:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-17 14:42:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-17 14:42:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-03-17 14:42:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-17 14:42:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-17 14:42:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-17 14:42:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-17 14:42:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-17 14:42:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-17 14:42:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-17 14:42:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-17 14:42:32,799 INFO L234 CfgBuilder]: Building ICFG [2022-03-17 14:42:32,800 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-17 14:42:32,924 INFO L275 CfgBuilder]: Performing block encoding [2022-03-17 14:42:32,928 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-17 14:42:32,928 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-03-17 14:42:32,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 02:42:32 BoogieIcfgContainer [2022-03-17 14:42:32,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-17 14:42:32,930 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-17 14:42:32,930 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-17 14:42:32,931 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-17 14:42:32,933 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 02:42:32" (1/1) ... [2022-03-17 14:42:32,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 02:42:32 BasicIcfg [2022-03-17 14:42:32,948 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-17 14:42:32,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-17 14:42:32,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-17 14:42:32,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-17 14:42:32,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:42:32" (1/4) ... [2022-03-17 14:42:32,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6a4d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:42:32, skipping insertion in model container [2022-03-17 14:42:32,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:32" (2/4) ... [2022-03-17 14:42:32,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6a4d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:42:32, skipping insertion in model container [2022-03-17 14:42:32,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 02:42:32" (3/4) ... [2022-03-17 14:42:32,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6a4d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:42:32, skipping insertion in model container [2022-03-17 14:42:32,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 02:42:32" (4/4) ... [2022-03-17 14:42:32,953 INFO L111 eAbstractionObserver]: Analyzing ICFG vogal-2.iJordan [2022-03-17 14:42:32,957 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-17 14:42:32,957 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-17 14:42:32,985 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-17 14:42:32,990 INFO L340 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 [2022-03-17 14:42:32,990 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-17 14:42:32,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-17 14:42:33,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-17 14:42:33,004 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:42:33,004 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:42:33,005 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 14:42:33,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:42:33,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1974064059, now seen corresponding path program 1 times [2022-03-17 14:42:33,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:42:33,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892770178] [2022-03-17 14:42:33,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:42:33,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:42:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:33,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:42:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:33,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:42:33,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:42:33,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892770178] [2022-03-17 14:42:33,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892770178] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 14:42:33,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 14:42:33,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-17 14:42:33,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44227831] [2022-03-17 14:42:33,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:42:33,276 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-17 14:42:33,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:42:33,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-17 14:42:33,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-17 14:42:33,309 INFO L87 Difference]: Start difference. First operand has 36 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:33,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:42:33,353 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-03-17 14:42:33,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-17 14:42:33,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-17 14:42:33,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:42:33,366 INFO L225 Difference]: With dead ends: 36 [2022-03-17 14:42:33,366 INFO L226 Difference]: Without dead ends: 29 [2022-03-17 14:42:33,368 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-03-17 14:42:33,376 INFO L912 BasicCegarLoop]: 42 mSDtfsCounter, 34 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 14:42:33,377 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 45 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 14:42:33,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-03-17 14:42:33,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-03-17 14:42:33,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-03-17 14:42:33,413 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 17 [2022-03-17 14:42:33,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:42:33,414 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-03-17 14:42:33,414 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-03-17 14:42:33,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 14:42:33,416 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:42:33,416 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:42:33,416 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-17 14:42:33,417 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 14:42:33,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:42:33,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1576298534, now seen corresponding path program 1 times [2022-03-17 14:42:33,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:42:33,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731713075] [2022-03-17 14:42:33,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:42:33,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:42:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:33,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:42:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:33,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:42:33,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:42:33,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731713075] [2022-03-17 14:42:33,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731713075] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 14:42:33,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 14:42:33,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-17 14:42:33,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421692496] [2022-03-17 14:42:33,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:42:33,555 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-17 14:42:33,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:42:33,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-17 14:42:33,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-17 14:42:33,557 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:33,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:42:33,652 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2022-03-17 14:42:33,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-17 14:42:33,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 14:42:33,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:42:33,654 INFO L225 Difference]: With dead ends: 44 [2022-03-17 14:42:33,654 INFO L226 Difference]: Without dead ends: 44 [2022-03-17 14:42:33,655 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-17 14:42:33,656 INFO L912 BasicCegarLoop]: 27 mSDtfsCounter, 63 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 14:42:33,656 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 34 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 14:42:33,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-03-17 14:42:33,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-03-17 14:42:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:33,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-03-17 14:42:33,661 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 19 [2022-03-17 14:42:33,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:42:33,661 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-03-17 14:42:33,661 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:33,662 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-03-17 14:42:33,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-17 14:42:33,662 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:42:33,662 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:42:33,662 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-17 14:42:33,662 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 14:42:33,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:42:33,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1150961380, now seen corresponding path program 1 times [2022-03-17 14:42:33,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:42:33,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693223020] [2022-03-17 14:42:33,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:42:33,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:42:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:33,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:42:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:33,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 14:42:33,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:42:33,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693223020] [2022-03-17 14:42:33,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693223020] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 14:42:33,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593066830] [2022-03-17 14:42:33,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:42:33,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 14:42:33,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 14:42:33,815 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-03-17 14:42:33,821 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-03-17 14:42:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:33,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 14:42:33,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 14:42:33,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 14:42:33,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 14:42:33,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593066830] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 14:42:33,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 14:42:33,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2022-03-17 14:42:33,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625718332] [2022-03-17 14:42:33,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:42:33,992 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 14:42:33,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:42:33,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 14:42:33,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-17 14:42:33,994 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:34,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:42:34,029 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-03-17 14:42:34,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 14:42:34,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-03-17 14:42:34,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:42:34,032 INFO L225 Difference]: With dead ends: 52 [2022-03-17 14:42:34,032 INFO L226 Difference]: Without dead ends: 49 [2022-03-17 14:42:34,032 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-03-17 14:42:34,033 INFO L912 BasicCegarLoop]: 35 mSDtfsCounter, 30 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 14:42:34,033 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 150 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 14:42:34,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-03-17 14:42:34,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2022-03-17 14:42:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:34,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2022-03-17 14:42:34,042 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 21 [2022-03-17 14:42:34,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:42:34,042 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2022-03-17 14:42:34,042 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:34,042 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2022-03-17 14:42:34,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-17 14:42:34,045 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:42:34,045 INFO L500 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-03-17 14:42:34,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-17 14:42:34,266 WARN L460 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-03-17 14:42:34,266 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 14:42:34,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:42:34,266 INFO L85 PathProgramCache]: Analyzing trace with hash 452661009, now seen corresponding path program 1 times [2022-03-17 14:42:34,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:42:34,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828254031] [2022-03-17 14:42:34,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:42:34,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:42:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:34,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:42:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 14:42:34,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:42:34,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828254031] [2022-03-17 14:42:34,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828254031] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 14:42:34,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261060954] [2022-03-17 14:42:34,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:42:34,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 14:42:34,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 14:42:34,349 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-03-17 14:42:34,350 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-03-17 14:42:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:34,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 14:42:34,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 14:42:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 14:42:34,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 14:42:34,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261060954] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 14:42:34,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 14:42:34,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-03-17 14:42:34,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385566194] [2022-03-17 14:42:34,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:42:34,458 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-17 14:42:34,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:42:34,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-17 14:42:34,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-17 14:42:34,459 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:34,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:42:34,488 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2022-03-17 14:42:34,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-17 14:42:34,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-03-17 14:42:34,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:42:34,491 INFO L225 Difference]: With dead ends: 70 [2022-03-17 14:42:34,491 INFO L226 Difference]: Without dead ends: 70 [2022-03-17 14:42:34,491 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-17 14:42:34,492 INFO L912 BasicCegarLoop]: 30 mSDtfsCounter, 27 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 14:42:34,492 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 67 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 14:42:34,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-03-17 14:42:34,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 46. [2022-03-17 14:42:34,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:34,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2022-03-17 14:42:34,497 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 27 [2022-03-17 14:42:34,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:42:34,498 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2022-03-17 14:42:34,498 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:34,498 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2022-03-17 14:42:34,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-17 14:42:34,498 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:42:34,499 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:42:34,516 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-03-17 14:42:34,707 WARN L460 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-03-17 14:42:34,708 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 14:42:34,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:42:34,708 INFO L85 PathProgramCache]: Analyzing trace with hash -302875202, now seen corresponding path program 1 times [2022-03-17 14:42:34,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:42:34,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69024417] [2022-03-17 14:42:34,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:42:34,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:42:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:34,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:42:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:34,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-17 14:42:34,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:42:34,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69024417] [2022-03-17 14:42:34,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69024417] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 14:42:34,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340460112] [2022-03-17 14:42:34,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:42:34,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 14:42:34,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 14:42:34,781 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-03-17 14:42:34,782 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-03-17 14:42:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:34,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-17 14:42:34,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 14:42:35,004 INFO L390 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-03-17 14:42:35,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 14:42:35,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 14:42:35,170 INFO L356 Elim1Store]: treesize reduction 38, result has 11.6 percent of original size [2022-03-17 14:42:35,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 31 [2022-03-17 14:42:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 14:42:35,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340460112] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-17 14:42:35,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-17 14:42:35,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 9] total 16 [2022-03-17 14:42:35,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464142404] [2022-03-17 14:42:35,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:42:35,211 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 14:42:35,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:42:35,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 14:42:35,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-03-17 14:42:35,212 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:35,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:42:35,342 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-03-17 14:42:35,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 14:42:35,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-03-17 14:42:35,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:42:35,343 INFO L225 Difference]: With dead ends: 49 [2022-03-17 14:42:35,343 INFO L226 Difference]: Without dead ends: 44 [2022-03-17 14:42:35,343 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2022-03-17 14:42:35,344 INFO L912 BasicCegarLoop]: 31 mSDtfsCounter, 11 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 14:42:35,344 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 161 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 14:42:35,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-03-17 14:42:35,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-03-17 14:42:35,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-03-17 14:42:35,347 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 28 [2022-03-17 14:42:35,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:42:35,347 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-03-17 14:42:35,347 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:35,348 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-03-17 14:42:35,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-17 14:42:35,348 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:42:35,348 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:42:35,369 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-03-17 14:42:35,563 WARN L460 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-03-17 14:42:35,564 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 14:42:35,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:42:35,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1691240082, now seen corresponding path program 1 times [2022-03-17 14:42:35,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:42:35,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065653480] [2022-03-17 14:42:35,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:42:35,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:42:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:35,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:42:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:35,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-17 14:42:35,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:42:35,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065653480] [2022-03-17 14:42:35,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065653480] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 14:42:35,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787534023] [2022-03-17 14:42:35,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:42:35,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 14:42:35,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 14:42:35,640 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-03-17 14:42:35,641 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-03-17 14:42:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:35,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-17 14:42:35,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 14:42:35,833 INFO L390 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 8 [2022-03-17 14:42:35,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 14:42:35,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 14:42:35,963 INFO L356 Elim1Store]: treesize reduction 38, result has 11.6 percent of original size [2022-03-17 14:42:35,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 32 [2022-03-17 14:42:36,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-17 14:42:36,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787534023] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 14:42:36,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 14:42:36,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 7] total 16 [2022-03-17 14:42:36,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335335884] [2022-03-17 14:42:36,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 14:42:36,009 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-17 14:42:36,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:42:36,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-17 14:42:36,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-03-17 14:42:36,010 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:42:36,402 INFO L93 Difference]: Finished difference Result 130 states and 176 transitions. [2022-03-17 14:42:36,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-17 14:42:36,402 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-03-17 14:42:36,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:42:36,403 INFO L225 Difference]: With dead ends: 130 [2022-03-17 14:42:36,403 INFO L226 Difference]: Without dead ends: 130 [2022-03-17 14:42:36,404 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2022-03-17 14:42:36,404 INFO L912 BasicCegarLoop]: 24 mSDtfsCounter, 269 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 14:42:36,405 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 72 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-17 14:42:36,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-03-17 14:42:36,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 48. [2022-03-17 14:42:36,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-03-17 14:42:36,409 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 29 [2022-03-17 14:42:36,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:42:36,409 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-03-17 14:42:36,409 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-03-17 14:42:36,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-17 14:42:36,410 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:42:36,410 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:42:36,434 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-03-17 14:42:36,631 WARN L460 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-03-17 14:42:36,631 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 14:42:36,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:42:36,632 INFO L85 PathProgramCache]: Analyzing trace with hash 671956355, now seen corresponding path program 1 times [2022-03-17 14:42:36,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:42:36,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757311906] [2022-03-17 14:42:36,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:42:36,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:42:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:36,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:42:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:36,703 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-17 14:42:36,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:42:36,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757311906] [2022-03-17 14:42:36,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757311906] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 14:42:36,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336574228] [2022-03-17 14:42:36,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:42:36,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 14:42:36,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 14:42:36,719 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-03-17 14:42:36,720 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-03-17 14:42:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:36,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-17 14:42:36,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 14:42:36,819 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 14:42:36,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 14:42:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-17 14:42:36,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336574228] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 14:42:36,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 14:42:36,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 10 [2022-03-17 14:42:36,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838158305] [2022-03-17 14:42:36,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 14:42:36,869 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-17 14:42:36,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:42:36,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-17 14:42:36,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-03-17 14:42:36,869 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:37,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:42:37,370 INFO L93 Difference]: Finished difference Result 281 states and 377 transitions. [2022-03-17 14:42:37,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-17 14:42:37,370 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-03-17 14:42:37,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:42:37,372 INFO L225 Difference]: With dead ends: 281 [2022-03-17 14:42:37,372 INFO L226 Difference]: Without dead ends: 281 [2022-03-17 14:42:37,372 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=228, Invalid=584, Unknown=0, NotChecked=0, Total=812 [2022-03-17 14:42:37,373 INFO L912 BasicCegarLoop]: 40 mSDtfsCounter, 457 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-17 14:42:37,373 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [457 Valid, 67 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-17 14:42:37,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-03-17 14:42:37,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 78. [2022-03-17 14:42:37,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 73 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:37,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 98 transitions. [2022-03-17 14:42:37,385 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 98 transitions. Word has length 32 [2022-03-17 14:42:37,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:42:37,386 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 98 transitions. [2022-03-17 14:42:37,386 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:37,386 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 98 transitions. [2022-03-17 14:42:37,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-17 14:42:37,388 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:42:37,388 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:42:37,406 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-03-17 14:42:37,599 WARN L460 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-03-17 14:42:37,599 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 14:42:37,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:42:37,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1036352920, now seen corresponding path program 2 times [2022-03-17 14:42:37,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:42:37,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109603687] [2022-03-17 14:42:37,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:42:37,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:42:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:37,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:42:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-17 14:42:37,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:42:37,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109603687] [2022-03-17 14:42:37,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109603687] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 14:42:37,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247975889] [2022-03-17 14:42:37,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 14:42:37,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 14:42:37,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 14:42:37,683 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-03-17 14:42:37,684 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-03-17 14:42:37,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 14:42:37,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 14:42:37,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-17 14:42:37,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 14:42:37,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-17 14:42:37,886 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-17 14:42:37,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 14:42:38,326 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-03-17 14:42:38,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247975889] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 14:42:38,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 14:42:38,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 11] total 22 [2022-03-17 14:42:38,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716859091] [2022-03-17 14:42:38,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 14:42:38,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-17 14:42:38,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:42:38,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-17 14:42:38,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2022-03-17 14:42:38,328 INFO L87 Difference]: Start difference. First operand 78 states and 98 transitions. Second operand has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:42:40,193 INFO L93 Difference]: Finished difference Result 1052 states and 1405 transitions. [2022-03-17 14:42:40,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-17 14:42:40,194 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-03-17 14:42:40,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:42:40,198 INFO L225 Difference]: With dead ends: 1052 [2022-03-17 14:42:40,198 INFO L226 Difference]: Without dead ends: 1052 [2022-03-17 14:42:40,199 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=779, Invalid=3253, Unknown=0, NotChecked=0, Total=4032 [2022-03-17 14:42:40,200 INFO L912 BasicCegarLoop]: 63 mSDtfsCounter, 1126 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-17 14:42:40,200 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [1126 Valid, 119 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-17 14:42:40,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2022-03-17 14:42:40,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 134. [2022-03-17 14:42:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.302325581395349) internal successors, (168), 129 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions. [2022-03-17 14:42:40,222 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 43 [2022-03-17 14:42:40,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:42:40,222 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 172 transitions. [2022-03-17 14:42:40,222 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:40,222 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions. [2022-03-17 14:42:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-17 14:42:40,223 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:42:40,223 INFO L500 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:42:40,245 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-03-17 14:42:40,424 WARN L460 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-03-17 14:42:40,424 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 14:42:40,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:42:40,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1669091715, now seen corresponding path program 3 times [2022-03-17 14:42:40,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:42:40,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758607347] [2022-03-17 14:42:40,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:42:40,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:42:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:40,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:42:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:40,504 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-03-17 14:42:40,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:42:40,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758607347] [2022-03-17 14:42:40,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758607347] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 14:42:40,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459349696] [2022-03-17 14:42:40,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-17 14:42:40,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 14:42:40,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 14:42:40,506 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 14:42:40,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-17 14:42:40,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-17 14:42:40,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 14:42:40,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-17 14:42:40,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 14:42:40,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-17 14:42:40,854 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-17 14:42:40,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-03-17 14:42:40,889 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-03-17 14:42:40,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 14:42:41,123 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-17 14:42:41,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 1 [2022-03-17 14:42:41,151 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-03-17 14:42:41,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459349696] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-17 14:42:41,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-17 14:42:41,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8, 10] total 24 [2022-03-17 14:42:41,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348239014] [2022-03-17 14:42:41,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 14:42:41,154 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-17 14:42:41,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:42:41,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-17 14:42:41,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2022-03-17 14:42:41,155 INFO L87 Difference]: Start difference. First operand 134 states and 172 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:41,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:42:41,247 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2022-03-17 14:42:41,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-17 14:42:41,247 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-03-17 14:42:41,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:42:41,248 INFO L225 Difference]: With dead ends: 143 [2022-03-17 14:42:41,248 INFO L226 Difference]: Without dead ends: 137 [2022-03-17 14:42:41,248 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2022-03-17 14:42:41,249 INFO L912 BasicCegarLoop]: 27 mSDtfsCounter, 48 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 14:42:41,249 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 154 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 14:42:41,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-03-17 14:42:41,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 101. [2022-03-17 14:42:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.28125) internal successors, (123), 96 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 127 transitions. [2022-03-17 14:42:41,254 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 127 transitions. Word has length 51 [2022-03-17 14:42:41,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:42:41,254 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 127 transitions. [2022-03-17 14:42:41,254 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:41,254 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 127 transitions. [2022-03-17 14:42:41,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-03-17 14:42:41,255 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:42:41,255 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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-03-17 14:42:41,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-17 14:42:41,471 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 14:42:41,472 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 14:42:41,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:42:41,472 INFO L85 PathProgramCache]: Analyzing trace with hash 860965540, now seen corresponding path program 1 times [2022-03-17 14:42:41,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:42:41,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691282550] [2022-03-17 14:42:41,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:42:41,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:42:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:41,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:42:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-03-17 14:42:41,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:42:41,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691282550] [2022-03-17 14:42:41,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691282550] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 14:42:41,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606525712] [2022-03-17 14:42:41,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:42:41,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 14:42:41,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 14:42:41,549 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 14:42:41,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-17 14:42:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:41,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-17 14:42:41,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 14:42:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-17 14:42:41,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 14:42:41,848 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-17 14:42:41,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606525712] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 14:42:41,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 14:42:41,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-03-17 14:42:41,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869329825] [2022-03-17 14:42:41,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 14:42:41,849 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-17 14:42:41,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:42:41,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-17 14:42:41,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-03-17 14:42:41,850 INFO L87 Difference]: Start difference. First operand 101 states and 127 transitions. Second operand has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 17 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:45,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:42:45,131 INFO L93 Difference]: Finished difference Result 828 states and 1101 transitions. [2022-03-17 14:42:45,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-17 14:42:45,131 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 17 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-03-17 14:42:45,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:42:45,133 INFO L225 Difference]: With dead ends: 828 [2022-03-17 14:42:45,134 INFO L226 Difference]: Without dead ends: 828 [2022-03-17 14:42:45,135 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2153 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1335, Invalid=5471, Unknown=0, NotChecked=0, Total=6806 [2022-03-17 14:42:45,136 INFO L912 BasicCegarLoop]: 112 mSDtfsCounter, 1798 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1885 mSolverCounterSat, 600 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1798 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 2485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 600 IncrementalHoareTripleChecker+Valid, 1885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-17 14:42:45,137 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [1798 Valid, 164 Invalid, 2485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [600 Valid, 1885 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-17 14:42:45,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2022-03-17 14:42:45,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 211. [2022-03-17 14:42:45,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 206 states have (on average 1.3058252427184467) internal successors, (269), 206 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:45,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 273 transitions. [2022-03-17 14:42:45,156 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 273 transitions. Word has length 54 [2022-03-17 14:42:45,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:42:45,156 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 273 transitions. [2022-03-17 14:42:45,156 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 17 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 273 transitions. [2022-03-17 14:42:45,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-03-17 14:42:45,158 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:42:45,158 INFO L500 BasicCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 5, 5, 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-03-17 14:42:45,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-17 14:42:45,371 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-17 14:42:45,372 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 14:42:45,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:42:45,372 INFO L85 PathProgramCache]: Analyzing trace with hash -247948122, now seen corresponding path program 2 times [2022-03-17 14:42:45,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:42:45,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054477166] [2022-03-17 14:42:45,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:42:45,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:42:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:45,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:42:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:45,535 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2022-03-17 14:42:45,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:42:45,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054477166] [2022-03-17 14:42:45,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054477166] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 14:42:45,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615353350] [2022-03-17 14:42:45,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 14:42:45,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 14:42:45,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 14:42:45,537 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 14:42:45,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-17 14:42:45,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 14:42:45,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 14:42:45,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-17 14:42:45,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 14:42:45,809 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2022-03-17 14:42:45,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 14:42:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2022-03-17 14:42:46,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615353350] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 14:42:46,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 14:42:46,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-03-17 14:42:46,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546922976] [2022-03-17 14:42:46,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 14:42:46,041 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-17 14:42:46,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:42:46,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-17 14:42:46,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-03-17 14:42:46,042 INFO L87 Difference]: Start difference. First operand 211 states and 273 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:46,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:42:46,750 INFO L93 Difference]: Finished difference Result 1462 states and 1950 transitions. [2022-03-17 14:42:46,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-17 14:42:46,751 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-03-17 14:42:46,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:42:46,755 INFO L225 Difference]: With dead ends: 1462 [2022-03-17 14:42:46,755 INFO L226 Difference]: Without dead ends: 1462 [2022-03-17 14:42:46,755 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-03-17 14:42:46,756 INFO L912 BasicCegarLoop]: 84 mSDtfsCounter, 696 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-17 14:42:46,756 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [696 Valid, 116 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-17 14:42:46,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2022-03-17 14:42:46,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 221. [2022-03-17 14:42:46,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 216 states have (on average 1.2916666666666667) internal successors, (279), 216 states have internal predecessors, (279), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:46,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 283 transitions. [2022-03-17 14:42:46,765 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 283 transitions. Word has length 92 [2022-03-17 14:42:46,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:42:46,765 INFO L478 AbstractCegarLoop]: Abstraction has 221 states and 283 transitions. [2022-03-17 14:42:46,765 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:42:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 283 transitions. [2022-03-17 14:42:46,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-03-17 14:42:46,767 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:42:46,767 INFO L500 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 8, 8, 8, 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-03-17 14:42:46,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-17 14:42:46,983 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 14:42:46,983 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 14:42:46,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:42:46,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1837140656, now seen corresponding path program 3 times [2022-03-17 14:42:46,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:42:46,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401415463] [2022-03-17 14:42:46,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:42:46,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:42:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:49,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:42:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:42:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 21 proven. 221 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-03-17 14:42:49,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:42:49,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401415463] [2022-03-17 14:42:49,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401415463] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 14:42:49,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668608661] [2022-03-17 14:42:49,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-17 14:42:49,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 14:42:49,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 14:42:49,943 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 14:42:49,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-17 14:42:51,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-03-17 14:42:51,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 14:42:51,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 75 conjunts are in the unsatisfiable core [2022-03-17 14:42:51,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 14:42:51,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-17 14:42:51,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-17 14:42:51,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-17 14:42:51,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-17 14:42:51,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-17 14:42:51,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-17 14:42:51,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-17 14:42:51,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-17 14:42:51,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-17 14:42:51,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-17 14:42:51,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-17 14:42:51,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-17 14:42:52,639 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 16 proven. 96 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2022-03-17 14:42:52,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 14:42:59,788 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_296 (Array Int Int))) (let ((.cse0 (select v_ArrVal_296 |c_main_~#string_entrada~0.offset|)) (.cse1 (select (store |c_#memory_int| |c_main_~#string_entrada~0.base| v_ArrVal_296) |c_main_~#vetor_vogais~0.base|))) (or (< .cse0 (select .cse1 (+ |c_main_~#vetor_vogais~0.offset| 7))) (not (= .cse0 (select .cse1 (+ |c_main_~#vetor_vogais~0.offset| 1))))))) is different from false [2022-03-17 14:42:59,949 WARN L833 $PredicateComparison]: unable to prove that (or (not (< (mod c_main_~i~0 4294967296) 10)) (forall ((v_ArrVal_296 (Array Int Int))) (let ((.cse0 (select v_ArrVal_296 |c_main_~#string_entrada~0.offset|)) (.cse1 (select (store |c_#memory_int| |c_main_~#string_entrada~0.base| v_ArrVal_296) |c_main_~#vetor_vogais~0.base|))) (or (< .cse0 (select .cse1 (+ |c_main_~#vetor_vogais~0.offset| 7))) (not (= .cse0 (select .cse1 (+ |c_main_~#vetor_vogais~0.offset| 1)))))))) is different from false [2022-03-17 14:42:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 65 proven. 74 refuted. 0 times theorem prover too weak. 193 trivial. 10 not checked. [2022-03-17 14:42:59,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668608661] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 14:42:59,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 14:42:59,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 15, 23] total 66 [2022-03-17 14:42:59,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451109236] [2022-03-17 14:42:59,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 14:42:59,966 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-03-17 14:42:59,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:42:59,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-03-17 14:42:59,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=3573, Unknown=2, NotChecked=250, Total=4290 [2022-03-17 14:42:59,968 INFO L87 Difference]: Start difference. First operand 221 states and 283 transitions. Second operand has 66 states, 66 states have (on average 2.5757575757575757) internal successors, (170), 65 states have internal predecessors, (170), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:43:02,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:43:02,488 INFO L93 Difference]: Finished difference Result 267 states and 342 transitions. [2022-03-17 14:43:02,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-17 14:43:02,489 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.5757575757575757) internal successors, (170), 65 states have internal predecessors, (170), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-03-17 14:43:02,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:43:02,489 INFO L225 Difference]: With dead ends: 267 [2022-03-17 14:43:02,489 INFO L226 Difference]: Without dead ends: 267 [2022-03-17 14:43:02,491 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 212 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2435 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1069, Invalid=7867, Unknown=2, NotChecked=374, Total=9312 [2022-03-17 14:43:02,491 INFO L912 BasicCegarLoop]: 37 mSDtfsCounter, 299 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 426 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-17 14:43:02,491 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 124 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 896 Invalid, 0 Unknown, 426 Unchecked, 0.6s Time] [2022-03-17 14:43:02,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-03-17 14:43:02,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2022-03-17 14:43:02,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 260 states have (on average 1.2923076923076924) internal successors, (336), 260 states have internal predecessors, (336), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:43:02,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 340 transitions. [2022-03-17 14:43:02,496 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 340 transitions. Word has length 102 [2022-03-17 14:43:02,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:43:02,496 INFO L478 AbstractCegarLoop]: Abstraction has 265 states and 340 transitions. [2022-03-17 14:43:02,497 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.5757575757575757) internal successors, (170), 65 states have internal predecessors, (170), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:43:02,497 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 340 transitions. [2022-03-17 14:43:02,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-03-17 14:43:02,497 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:43:02,497 INFO L500 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 8, 8, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:43:02,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-17 14:43:02,698 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-17 14:43:02,698 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 14:43:02,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:43:02,698 INFO L85 PathProgramCache]: Analyzing trace with hash 653793359, now seen corresponding path program 1 times [2022-03-17 14:43:02,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:43:02,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411229069] [2022-03-17 14:43:02,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:43:02,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:43:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:43:03,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:43:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:43:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 52 proven. 26 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-03-17 14:43:03,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:43:03,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411229069] [2022-03-17 14:43:03,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411229069] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 14:43:03,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645616608] [2022-03-17 14:43:03,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:43:03,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 14:43:03,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 14:43:03,408 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 14:43:03,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-17 14:43:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:43:03,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-17 14:43:03,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 14:43:03,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-17 14:43:03,696 INFO L390 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 23 [2022-03-17 14:43:03,741 INFO L390 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 23 [2022-03-17 14:43:03,795 INFO L390 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 23 [2022-03-17 14:43:03,832 INFO L390 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 23 [2022-03-17 14:43:03,851 INFO L390 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 23 [2022-03-17 14:43:03,870 INFO L390 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 23 [2022-03-17 14:43:03,891 INFO L390 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 23 [2022-03-17 14:43:03,911 INFO L390 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 23 [2022-03-17 14:43:03,931 INFO L390 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 23 [2022-03-17 14:43:03,949 INFO L390 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 23 [2022-03-17 14:43:03,985 INFO L390 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 23 [2022-03-17 14:43:04,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2022-03-17 14:43:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 63 proven. 62 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-03-17 14:43:04,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 14:43:15,106 WARN L833 $PredicateComparison]: unable to prove that (forall ((|main_~#string_entrada~0.offset| Int) (v_ArrVal_363 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_main_~#string_entrada~0.base| v_ArrVal_363) |c_main_~#vetor_vogais~0.base|)) (.cse0 (select v_ArrVal_363 |main_~#string_entrada~0.offset|))) (or (< .cse0 (select .cse1 (+ |c_main_~#vetor_vogais~0.offset| 2))) (< (select .cse1 |c_main_~#vetor_vogais~0.offset|) .cse0)))) is different from false [2022-03-17 14:43:15,210 WARN L833 $PredicateComparison]: unable to prove that (or (not (< (mod c_main_~i~0 4294967296) 10)) (forall ((|main_~#string_entrada~0.offset| Int) (v_ArrVal_363 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_main_~#string_entrada~0.base| v_ArrVal_363) |c_main_~#vetor_vogais~0.base|)) (.cse0 (select v_ArrVal_363 |main_~#string_entrada~0.offset|))) (or (< .cse0 (select .cse1 (+ |c_main_~#vetor_vogais~0.offset| 2))) (< (select .cse1 |c_main_~#vetor_vogais~0.offset|) .cse0))))) is different from false [2022-03-17 14:43:15,223 WARN L833 $PredicateComparison]: unable to prove that (or (not (< (mod (+ c_main_~i~0 1) 4294967296) 10)) (forall ((|main_~#string_entrada~0.offset| Int) (v_ArrVal_363 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_main_~#string_entrada~0.base| v_ArrVal_363) |c_main_~#vetor_vogais~0.base|)) (.cse0 (select v_ArrVal_363 |main_~#string_entrada~0.offset|))) (or (< .cse0 (select .cse1 (+ |c_main_~#vetor_vogais~0.offset| 2))) (< (select .cse1 |c_main_~#vetor_vogais~0.offset|) .cse0))))) is different from false [2022-03-17 14:43:15,932 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 72 proven. 10 refuted. 0 times theorem prover too weak. 217 trivial. 43 not checked. [2022-03-17 14:43:15,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645616608] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 14:43:15,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 14:43:15,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 19] total 43 [2022-03-17 14:43:15,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905964936] [2022-03-17 14:43:15,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 14:43:15,933 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-17 14:43:15,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 14:43:15,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-17 14:43:15,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1328, Unknown=13, NotChecked=234, Total=1806 [2022-03-17 14:43:15,934 INFO L87 Difference]: Start difference. First operand 265 states and 340 transitions. Second operand has 43 states, 43 states have (on average 2.697674418604651) internal successors, (116), 42 states have internal predecessors, (116), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:43:39,182 WARN L232 SmtUtils]: Spent 17.86s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 14:43:39,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 14:43:39,703 INFO L93 Difference]: Finished difference Result 489 states and 626 transitions. [2022-03-17 14:43:39,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-17 14:43:39,704 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.697674418604651) internal successors, (116), 42 states have internal predecessors, (116), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-03-17 14:43:39,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 14:43:39,705 INFO L225 Difference]: With dead ends: 489 [2022-03-17 14:43:39,705 INFO L226 Difference]: Without dead ends: 489 [2022-03-17 14:43:39,707 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 200 SyntacticMatches, 6 SemanticMatches, 87 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 33.9s TimeCoverageRelationStatistics Valid=916, Invalid=6390, Unknown=16, NotChecked=510, Total=7832 [2022-03-17 14:43:39,707 INFO L912 BasicCegarLoop]: 31 mSDtfsCounter, 437 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 2258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 997 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-17 14:43:39,707 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 169 Invalid, 2258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1173 Invalid, 0 Unknown, 997 Unchecked, 0.8s Time] [2022-03-17 14:43:39,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-03-17 14:43:39,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 395. [2022-03-17 14:43:39,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 390 states have (on average 1.2871794871794873) internal successors, (502), 390 states have internal predecessors, (502), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:43:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 506 transitions. [2022-03-17 14:43:39,715 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 506 transitions. Word has length 102 [2022-03-17 14:43:39,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 14:43:39,715 INFO L478 AbstractCegarLoop]: Abstraction has 395 states and 506 transitions. [2022-03-17 14:43:39,715 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.697674418604651) internal successors, (116), 42 states have internal predecessors, (116), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 14:43:39,716 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 506 transitions. [2022-03-17 14:43:39,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-03-17 14:43:39,717 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 14:43:39,717 INFO L500 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 8, 8, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 14:43:39,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-17 14:43:39,930 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-17 14:43:39,930 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 14:43:39,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 14:43:39,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1697986001, now seen corresponding path program 1 times [2022-03-17 14:43:39,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 14:43:39,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526846339] [2022-03-17 14:43:39,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:43:39,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 14:43:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:43:40,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 14:43:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:43:40,804 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 46 proven. 40 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-03-17 14:43:40,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 14:43:40,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526846339] [2022-03-17 14:43:40,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526846339] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 14:43:40,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869530327] [2022-03-17 14:43:40,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 14:43:40,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 14:43:40,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 14:43:40,806 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 14:43:40,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-17 14:43:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 14:43:40,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-17 14:43:40,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 14:43:50,248 INFO L356 Elim1Store]: treesize reduction 82, result has 65.1 percent of original size [2022-03-17 14:43:50,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 195 treesize of output 251 [2022-03-17 14:43:55,784 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 64 proven. 95 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-03-17 14:43:55,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 14:43:59,081 INFO L356 Elim1Store]: treesize reduction 147, result has 69.6 percent of original size [2022-03-17 14:43:59,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 226 treesize of output 437 [2022-03-17 14:44:00,958 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-17 14:44:00,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-03-17 14:44:01,165 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-17 14:44:01,165 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Possible infinite loop detected aux_mod_aux_mod_main_~i~0_26_37 already exists at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.tryToHandleDivModSubterm(SolveForSubjectUtils.java:202) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:577) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.solveForSubject(SolveForSubjectUtils.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.solveForSubject(PolynomialRelation.java:490) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:422) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$IDerHelper.findBestReplacementSbr(DualJunctionDer.java:311) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$IDerHelper.tryToEliminateSbr(DualJunctionDer.java:327) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:234) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:201) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:185) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminate(DualJunctionDer.java:130) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:904) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) 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.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) 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.quantifier.QuantifierPusher.doit(QuantifierPusher.java:635) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) 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-03-17 14:44:01,170 INFO L158 Benchmark]: Toolchain (without parser) took 88747.47ms. Allocated memory was 192.9MB in the beginning and 335.5MB in the end (delta: 142.6MB). Free memory was 143.8MB in the beginning and 301.9MB in the end (delta: -158.0MB). Peak memory consumption was 177.0MB. Max. memory is 8.0GB. [2022-03-17 14:44:01,170 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 192.9MB. Free memory was 160.2MB in the beginning and 160.0MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-17 14:44:01,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.44ms. Allocated memory is still 192.9MB. Free memory was 143.6MB in the beginning and 168.6MB in the end (delta: -25.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-17 14:44:01,170 INFO L158 Benchmark]: Boogie Preprocessor took 52.63ms. Allocated memory is still 192.9MB. Free memory was 168.6MB in the beginning and 166.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-17 14:44:01,170 INFO L158 Benchmark]: RCFGBuilder took 245.56ms. Allocated memory is still 192.9MB. Free memory was 166.9MB in the beginning and 154.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-17 14:44:01,170 INFO L158 Benchmark]: IcfgTransformer took 17.77ms. Allocated memory is still 192.9MB. Free memory was 154.3MB in the beginning and 152.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-17 14:44:01,171 INFO L158 Benchmark]: TraceAbstraction took 88220.39ms. Allocated memory was 192.9MB in the beginning and 335.5MB in the end (delta: 142.6MB). Free memory was 152.6MB in the beginning and 301.9MB in the end (delta: -149.3MB). Peak memory consumption was 185.8MB. Max. memory is 8.0GB. [2022-03-17 14:44:01,172 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.11ms. Allocated memory is still 192.9MB. Free memory was 160.2MB in the beginning and 160.0MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.44ms. Allocated memory is still 192.9MB. Free memory was 143.6MB in the beginning and 168.6MB in the end (delta: -25.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.63ms. Allocated memory is still 192.9MB. Free memory was 168.6MB in the beginning and 166.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 245.56ms. Allocated memory is still 192.9MB. Free memory was 166.9MB in the beginning and 154.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 17.77ms. Allocated memory is still 192.9MB. Free memory was 154.3MB in the beginning and 152.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 88220.39ms. Allocated memory was 192.9MB in the beginning and 335.5MB in the end (delta: 142.6MB). Free memory was 152.6MB in the beginning and 301.9MB in the end (delta: -149.3MB). Peak memory consumption was 185.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Possible infinite loop detected aux_mod_aux_mod_main_~i~0_26_37 already exists de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Possible infinite loop detected aux_mod_aux_mod_main_~i~0_26_37 already exists: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.tryToHandleDivModSubterm(SolveForSubjectUtils.java:202) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-17 14:44:01,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...