/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/reducercommutativity/rangesum05.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 03:45:21,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 03:45:21,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 03:45:21,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 03:45:21,641 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 03:45:21,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 03:45:21,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 03:45:21,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 03:45:21,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 03:45:21,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 03:45:21,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 03:45:21,647 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 03:45:21,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 03:45:21,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 03:45:21,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 03:45:21,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 03:45:21,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 03:45:21,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 03:45:21,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 03:45:21,653 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 03:45:21,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 03:45:21,660 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 03:45:21,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 03:45:21,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 03:45:21,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 03:45:21,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 03:45:21,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 03:45:21,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 03:45:21,664 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 03:45:21,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 03:45:21,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 03:45:21,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 03:45:21,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 03:45:21,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 03:45:21,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 03:45:21,667 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 03:45:21,668 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 03:45:21,668 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 03:45:21,668 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 03:45:21,669 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 03:45:21,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 03:45:21,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 03:45:21,695 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 03:45:21,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 03:45:21,696 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 03:45:21,696 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 03:45:21,696 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 03:45:21,696 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 03:45:21,696 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 03:45:21,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 03:45:21,697 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 03:45:21,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 03:45:21,697 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 03:45:21,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 03:45:21,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 03:45:21,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 03:45:21,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 03:45:21,697 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 03:45:21,697 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 03:45:21,697 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 03:45:21,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 03:45:21,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 03:45:21,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 03:45:21,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 03:45:21,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 03:45:21,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:45:21,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 03:45:21,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 03:45:21,698 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 03:45:21,698 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 03:45:21,698 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 03:45:21,699 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 03:45:21,699 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 03:45:21,699 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 03:45:21,699 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 03:45:21,699 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 03:45:21,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 03:45:21,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 03:45:21,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 03:45:21,881 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 03:45:21,883 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 03:45:21,884 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/rangesum05.i [2022-01-10 03:45:21,937 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92029ff9b/b87edd3a12c04459abb077c31cf42670/FLAGb47d9b01d [2022-01-10 03:45:22,241 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 03:45:22,242 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum05.i [2022-01-10 03:45:22,246 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92029ff9b/b87edd3a12c04459abb077c31cf42670/FLAGb47d9b01d [2022-01-10 03:45:22,680 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92029ff9b/b87edd3a12c04459abb077c31cf42670 [2022-01-10 03:45:22,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 03:45:22,682 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 03:45:22,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 03:45:22,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 03:45:22,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 03:45:22,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:45:22" (1/1) ... [2022-01-10 03:45:22,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4303d0cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22, skipping insertion in model container [2022-01-10 03:45:22,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:45:22" (1/1) ... [2022-01-10 03:45:22,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 03:45:22,702 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 03:45:22,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum05.i[1457,1470] [2022-01-10 03:45:22,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:45:22,891 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 03:45:22,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum05.i[1457,1470] [2022-01-10 03:45:22,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:45:22,927 INFO L208 MainTranslator]: Completed translation [2022-01-10 03:45:22,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22 WrapperNode [2022-01-10 03:45:22,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 03:45:22,929 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 03:45:22,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 03:45:22,929 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 03:45:22,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22" (1/1) ... [2022-01-10 03:45:22,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22" (1/1) ... [2022-01-10 03:45:22,961 INFO L137 Inliner]: procedures = 19, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2022-01-10 03:45:22,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 03:45:22,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 03:45:22,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 03:45:22,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 03:45:22,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22" (1/1) ... [2022-01-10 03:45:22,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22" (1/1) ... [2022-01-10 03:45:22,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22" (1/1) ... [2022-01-10 03:45:22,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22" (1/1) ... [2022-01-10 03:45:22,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22" (1/1) ... [2022-01-10 03:45:22,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22" (1/1) ... [2022-01-10 03:45:22,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22" (1/1) ... [2022-01-10 03:45:22,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 03:45:22,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 03:45:22,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 03:45:22,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 03:45:22,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22" (1/1) ... [2022-01-10 03:45:22,998 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:45:23,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 03:45:23,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 03:45:23,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 03:45:23,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 03:45:23,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 03:45:23,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 03:45:23,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 03:45:23,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 03:45:23,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 03:45:23,057 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2022-01-10 03:45:23,057 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2022-01-10 03:45:23,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 03:45:23,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 03:45:23,122 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 03:45:23,123 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 03:45:23,470 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 03:45:23,473 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 03:45:23,474 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-10 03:45:23,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:45:23 BoogieIcfgContainer [2022-01-10 03:45:23,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 03:45:23,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 03:45:23,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 03:45:23,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 03:45:23,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:45:22" (1/3) ... [2022-01-10 03:45:23,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aeed47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:45:23, skipping insertion in model container [2022-01-10 03:45:23,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:45:22" (2/3) ... [2022-01-10 03:45:23,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aeed47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:45:23, skipping insertion in model container [2022-01-10 03:45:23,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:45:23" (3/3) ... [2022-01-10 03:45:23,480 INFO L111 eAbstractionObserver]: Analyzing ICFG rangesum05.i [2022-01-10 03:45:23,483 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 03:45:23,483 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 03:45:23,513 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 03:45:23,518 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 03:45:23,518 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 03:45:23,526 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 03:45:23,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 03:45:23,529 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:23,530 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:23,530 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:23,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:23,533 INFO L85 PathProgramCache]: Analyzing trace with hash -275565944, now seen corresponding path program 1 times [2022-01-10 03:45:23,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:23,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879199824] [2022-01-10 03:45:23,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:45:23,541 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:23,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:23,543 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:23,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 03:45:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:45:23,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 03:45:23,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:45:23,981 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 03:45:23,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:45:23,982 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:45:23,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879199824] [2022-01-10 03:45:23,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879199824] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:45:23,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:45:23,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 03:45:24,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144894497] [2022-01-10 03:45:24,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:45:24,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 03:45:24,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:45:24,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 03:45:24,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:45:24,038 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:45:24,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:45:24,061 INFO L93 Difference]: Finished difference Result 52 states and 73 transitions. [2022-01-10 03:45:24,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 03:45:24,075 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-01-10 03:45:24,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:45:24,079 INFO L225 Difference]: With dead ends: 52 [2022-01-10 03:45:24,079 INFO L226 Difference]: Without dead ends: 24 [2022-01-10 03:45:24,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:45:24,083 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:45:24,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:45:24,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-01-10 03:45:24,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-01-10 03:45:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 03:45:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-01-10 03:45:24,121 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 29 [2022-01-10 03:45:24,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:45:24,121 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-01-10 03:45:24,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:45:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-01-10 03:45:24,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 03:45:24,122 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:24,123 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:24,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 03:45:24,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:24,347 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:24,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:24,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1257002967, now seen corresponding path program 1 times [2022-01-10 03:45:24,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:24,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930900993] [2022-01-10 03:45:24,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:45:24,349 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:24,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:24,350 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:24,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 03:45:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:45:24,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 03:45:24,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:45:24,695 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 03:45:24,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:45:24,696 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:45:24,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930900993] [2022-01-10 03:45:24,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930900993] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:45:24,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:45:24,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 03:45:24,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653205293] [2022-01-10 03:45:24,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:45:24,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 03:45:24,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:45:24,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 03:45:24,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 03:45:24,698 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:45:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:45:24,719 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-01-10 03:45:24,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 03:45:24,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-01-10 03:45:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:45:24,721 INFO L225 Difference]: With dead ends: 46 [2022-01-10 03:45:24,721 INFO L226 Difference]: Without dead ends: 26 [2022-01-10 03:45:24,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 03:45:24,722 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:45:24,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:45:24,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-10 03:45:24,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-01-10 03:45:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 03:45:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-01-10 03:45:24,727 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 29 [2022-01-10 03:45:24,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:45:24,727 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-01-10 03:45:24,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:45:24,727 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-01-10 03:45:24,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 03:45:24,728 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:24,728 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:24,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 03:45:24,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:24,929 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:24,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:24,929 INFO L85 PathProgramCache]: Analyzing trace with hash -653100523, now seen corresponding path program 1 times [2022-01-10 03:45:24,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:24,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950023893] [2022-01-10 03:45:24,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:45:24,930 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:24,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:24,931 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:24,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 03:45:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:45:25,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 03:45:25,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:45:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 03:45:25,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:45:25,401 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 03:45:25,402 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:45:25,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950023893] [2022-01-10 03:45:25,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950023893] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:45:25,402 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:45:25,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 03:45:25,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648147044] [2022-01-10 03:45:25,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:45:25,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 03:45:25,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:45:25,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 03:45:25,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:45:25,403 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-10 03:45:25,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:45:25,455 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-01-10 03:45:25,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:45:25,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 31 [2022-01-10 03:45:25,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:45:25,457 INFO L225 Difference]: With dead ends: 51 [2022-01-10 03:45:25,457 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 03:45:25,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-01-10 03:45:25,458 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:45:25,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 80 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:45:25,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 03:45:25,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-01-10 03:45:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 03:45:25,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-01-10 03:45:25,465 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 31 [2022-01-10 03:45:25,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:45:25,466 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-01-10 03:45:25,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-10 03:45:25,466 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-01-10 03:45:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 03:45:25,467 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:25,467 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:25,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-01-10 03:45:25,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:25,686 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:25,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:25,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1590766641, now seen corresponding path program 2 times [2022-01-10 03:45:25,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:25,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050522997] [2022-01-10 03:45:25,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:45:25,688 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:25,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:25,689 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:25,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 03:45:25,797 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 03:45:25,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:45:25,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 03:45:25,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:45:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-01-10 03:45:25,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:45:25,864 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:45:25,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050522997] [2022-01-10 03:45:25,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050522997] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:45:25,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:45:25,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 03:45:25,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152234220] [2022-01-10 03:45:25,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:45:25,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 03:45:25,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:45:25,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 03:45:25,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 03:45:25,866 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:45:25,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:45:25,883 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-01-10 03:45:25,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 03:45:25,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-01-10 03:45:25,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:45:25,884 INFO L225 Difference]: With dead ends: 52 [2022-01-10 03:45:25,885 INFO L226 Difference]: Without dead ends: 34 [2022-01-10 03:45:25,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 03:45:25,886 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:45:25,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:45:25,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-10 03:45:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-01-10 03:45:25,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 03:45:25,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-01-10 03:45:25,890 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 37 [2022-01-10 03:45:25,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:45:25,890 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-01-10 03:45:25,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:45:25,890 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-01-10 03:45:25,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-10 03:45:25,891 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:25,891 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:25,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-01-10 03:45:26,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:26,100 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:26,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:26,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1553926542, now seen corresponding path program 1 times [2022-01-10 03:45:26,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:26,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736284020] [2022-01-10 03:45:26,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:45:26,101 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:26,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:26,102 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:26,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 03:45:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:45:26,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 03:45:26,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:45:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-01-10 03:45:26,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:45:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-01-10 03:45:26,671 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:45:26,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736284020] [2022-01-10 03:45:26,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736284020] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:45:26,671 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:45:26,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-01-10 03:45:26,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85604347] [2022-01-10 03:45:26,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:45:26,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 03:45:26,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:45:26,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 03:45:26,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-10 03:45:26,673 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-10 03:45:26,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:45:26,752 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2022-01-10 03:45:26,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 03:45:26,754 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2022-01-10 03:45:26,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:45:26,755 INFO L225 Difference]: With dead ends: 58 [2022-01-10 03:45:26,755 INFO L226 Difference]: Without dead ends: 36 [2022-01-10 03:45:26,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-10 03:45:26,756 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 5 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:45:26,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 210 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:45:26,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-10 03:45:26,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-01-10 03:45:26,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 03:45:26,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-01-10 03:45:26,760 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 46 [2022-01-10 03:45:26,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:45:26,760 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-01-10 03:45:26,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-10 03:45:26,760 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-01-10 03:45:26,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-10 03:45:26,761 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:26,761 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:26,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 03:45:26,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:26,977 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:26,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:26,978 INFO L85 PathProgramCache]: Analyzing trace with hash 446032656, now seen corresponding path program 2 times [2022-01-10 03:45:26,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:26,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891729414] [2022-01-10 03:45:26,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:45:26,979 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:26,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:26,980 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:26,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 03:45:27,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 03:45:27,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:45:27,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 03:45:27,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:45:27,189 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-10 03:45:27,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:45:27,189 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:45:27,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891729414] [2022-01-10 03:45:27,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891729414] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:45:27,190 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:45:27,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 03:45:27,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984387653] [2022-01-10 03:45:27,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:45:27,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 03:45:27,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:45:27,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 03:45:27,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 03:45:27,191 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:45:27,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:45:27,265 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2022-01-10 03:45:27,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 03:45:27,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2022-01-10 03:45:27,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:45:27,268 INFO L225 Difference]: With dead ends: 61 [2022-01-10 03:45:27,268 INFO L226 Difference]: Without dead ends: 41 [2022-01-10 03:45:27,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 03:45:27,269 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:45:27,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:45:27,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-10 03:45:27,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-01-10 03:45:27,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 03:45:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-01-10 03:45:27,276 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 48 [2022-01-10 03:45:27,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:45:27,276 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-01-10 03:45:27,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:45:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-01-10 03:45:27,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-10 03:45:27,278 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:27,278 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:27,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 03:45:27,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:27,483 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:27,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:27,484 INFO L85 PathProgramCache]: Analyzing trace with hash -777147091, now seen corresponding path program 1 times [2022-01-10 03:45:27,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:27,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464947301] [2022-01-10 03:45:27,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:45:27,485 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:27,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:27,487 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:27,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 03:45:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:45:27,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 03:45:27,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:45:27,654 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-01-10 03:45:27,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:45:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-10 03:45:27,758 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:45:27,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464947301] [2022-01-10 03:45:27,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464947301] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:45:27,759 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:45:27,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 03:45:27,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720888157] [2022-01-10 03:45:27,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:45:27,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 03:45:27,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:45:27,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 03:45:27,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:45:27,760 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 03:45:27,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:45:27,850 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2022-01-10 03:45:27,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:45:27,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2022-01-10 03:45:27,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:45:27,854 INFO L225 Difference]: With dead ends: 70 [2022-01-10 03:45:27,854 INFO L226 Difference]: Without dead ends: 46 [2022-01-10 03:45:27,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-01-10 03:45:27,855 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:45:27,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 74 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:45:27,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-10 03:45:27,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2022-01-10 03:45:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 03:45:27,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2022-01-10 03:45:27,861 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 48 [2022-01-10 03:45:27,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:45:27,861 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-01-10 03:45:27,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 03:45:27,861 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-01-10 03:45:27,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-10 03:45:27,862 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:27,862 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:27,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 03:45:28,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:28,068 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:28,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:28,068 INFO L85 PathProgramCache]: Analyzing trace with hash 323505165, now seen corresponding path program 1 times [2022-01-10 03:45:28,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:28,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318500100] [2022-01-10 03:45:28,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:45:28,069 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:28,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:28,076 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:28,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 03:45:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:45:28,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 03:45:28,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:45:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 85 proven. 7 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2022-01-10 03:45:28,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:45:28,701 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 13 proven. 127 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2022-01-10 03:45:28,701 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:45:28,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318500100] [2022-01-10 03:45:28,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318500100] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:45:28,702 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:45:28,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-01-10 03:45:28,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570722043] [2022-01-10 03:45:28,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:45:28,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 03:45:28,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:45:28,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 03:45:28,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-10 03:45:28,703 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 03:45:28,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:45:28,767 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-01-10 03:45:28,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:45:28,770 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2022-01-10 03:45:28,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:45:28,770 INFO L225 Difference]: With dead ends: 72 [2022-01-10 03:45:28,770 INFO L226 Difference]: Without dead ends: 44 [2022-01-10 03:45:28,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-10 03:45:28,771 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:45:28,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 171 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:45:28,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-10 03:45:28,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-01-10 03:45:28,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 03:45:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-01-10 03:45:28,775 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 75 [2022-01-10 03:45:28,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:45:28,775 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-01-10 03:45:28,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 03:45:28,775 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-01-10 03:45:28,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-10 03:45:28,776 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:28,776 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:28,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 03:45:28,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:28,988 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:28,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:28,988 INFO L85 PathProgramCache]: Analyzing trace with hash 2047624075, now seen corresponding path program 2 times [2022-01-10 03:45:28,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:28,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943682380] [2022-01-10 03:45:28,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:45:28,989 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:28,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:28,990 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:28,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 03:45:29,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 03:45:29,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:45:29,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 03:45:29,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:45:29,459 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 116 proven. 22 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-01-10 03:45:29,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:45:29,642 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-01-10 03:45:29,643 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:45:29,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943682380] [2022-01-10 03:45:29,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943682380] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:45:29,643 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:45:29,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-01-10 03:45:29,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158443866] [2022-01-10 03:45:29,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:45:29,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 03:45:29,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:45:29,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 03:45:29,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-10 03:45:29,644 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 03:45:29,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:45:29,786 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2022-01-10 03:45:29,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 03:45:29,787 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2022-01-10 03:45:29,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:45:29,788 INFO L225 Difference]: With dead ends: 79 [2022-01-10 03:45:29,788 INFO L226 Difference]: Without dead ends: 51 [2022-01-10 03:45:29,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-01-10 03:45:29,789 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:45:29,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 194 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:45:29,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-10 03:45:29,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-01-10 03:45:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 03:45:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2022-01-10 03:45:29,792 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 75 [2022-01-10 03:45:29,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:45:29,793 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2022-01-10 03:45:29,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 03:45:29,793 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-01-10 03:45:29,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 03:45:29,793 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:29,793 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:29,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 03:45:30,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:30,003 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:30,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:30,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1495598064, now seen corresponding path program 3 times [2022-01-10 03:45:30,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:30,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524577224] [2022-01-10 03:45:30,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 03:45:30,005 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:30,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:30,007 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:30,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 03:45:30,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-10 03:45:30,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:45:30,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 03:45:30,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:45:30,335 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-01-10 03:45:30,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:45:30,336 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:45:30,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524577224] [2022-01-10 03:45:30,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524577224] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:45:30,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:45:30,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 03:45:30,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814686679] [2022-01-10 03:45:30,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:45:30,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 03:45:30,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:45:30,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 03:45:30,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 03:45:30,337 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 03:45:30,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:45:30,374 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-01-10 03:45:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 03:45:30,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 84 [2022-01-10 03:45:30,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:45:30,376 INFO L225 Difference]: With dead ends: 82 [2022-01-10 03:45:30,376 INFO L226 Difference]: Without dead ends: 52 [2022-01-10 03:45:30,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 03:45:30,377 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:45:30,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 53 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:45:30,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-10 03:45:30,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-01-10 03:45:30,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 03:45:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-01-10 03:45:30,380 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 84 [2022-01-10 03:45:30,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:45:30,381 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-01-10 03:45:30,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 03:45:30,381 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-01-10 03:45:30,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-01-10 03:45:30,381 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:30,381 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:30,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 03:45:30,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:30,582 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:30,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:30,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1677708974, now seen corresponding path program 1 times [2022-01-10 03:45:30,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:30,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651437692] [2022-01-10 03:45:30,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:45:30,583 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:30,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:30,584 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:30,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 03:45:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:45:30,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 03:45:30,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:45:31,031 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 180 proven. 1 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-01-10 03:45:31,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:45:31,121 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-01-10 03:45:31,122 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:45:31,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651437692] [2022-01-10 03:45:31,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651437692] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:45:31,122 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:45:31,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 03:45:31,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471352189] [2022-01-10 03:45:31,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:45:31,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 03:45:31,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:45:31,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 03:45:31,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:45:31,123 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 03:45:31,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:45:31,170 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2022-01-10 03:45:31,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:45:31,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 86 [2022-01-10 03:45:31,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:45:31,171 INFO L225 Difference]: With dead ends: 87 [2022-01-10 03:45:31,171 INFO L226 Difference]: Without dead ends: 57 [2022-01-10 03:45:31,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-01-10 03:45:31,172 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 5 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:45:31,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 78 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:45:31,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-01-10 03:45:31,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-01-10 03:45:31,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 03:45:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-01-10 03:45:31,176 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 86 [2022-01-10 03:45:31,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:45:31,176 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-01-10 03:45:31,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 03:45:31,176 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-01-10 03:45:31,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-10 03:45:31,177 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:45:31,177 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:45:31,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 03:45:31,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:31,387 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:45:31,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:45:31,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1193894376, now seen corresponding path program 2 times [2022-01-10 03:45:31,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:45:31,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808026691] [2022-01-10 03:45:31,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:45:31,388 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:45:31,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:45:31,389 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:45:31,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 03:45:32,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 03:45:32,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-01-10 03:45:32,444 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 03:45:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 03:45:33,380 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 03:45:33,380 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 03:45:33,381 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 03:45:33,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-01-10 03:45:33,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:45:33,585 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1] [2022-01-10 03:45:33,587 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 03:45:33,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:45:33 BoogieIcfgContainer [2022-01-10 03:45:33,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 03:45:33,644 INFO L158 Benchmark]: Toolchain (without parser) took 10962.02ms. Allocated memory was 176.2MB in the beginning and 218.1MB in the end (delta: 41.9MB). Free memory was 126.8MB in the beginning and 146.8MB in the end (delta: -20.0MB). Peak memory consumption was 22.1MB. Max. memory is 8.0GB. [2022-01-10 03:45:33,645 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory was 143.3MB in the beginning and 143.2MB in the end (delta: 74.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 03:45:33,645 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.89ms. Allocated memory is still 176.2MB. Free memory was 126.6MB in the beginning and 153.2MB in the end (delta: -26.6MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-01-10 03:45:33,645 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.72ms. Allocated memory is still 176.2MB. Free memory was 153.2MB in the beginning and 151.2MB in the end (delta: 2.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 03:45:33,645 INFO L158 Benchmark]: Boogie Preprocessor took 28.66ms. Allocated memory is still 176.2MB. Free memory was 151.2MB in the beginning and 150.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 03:45:33,646 INFO L158 Benchmark]: RCFGBuilder took 483.82ms. Allocated memory is still 176.2MB. Free memory was 150.1MB in the beginning and 138.1MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-10 03:45:33,646 INFO L158 Benchmark]: TraceAbstraction took 10168.42ms. Allocated memory was 176.2MB in the beginning and 218.1MB in the end (delta: 41.9MB). Free memory was 138.0MB in the beginning and 146.8MB in the end (delta: -8.8MB). Peak memory consumption was 34.2MB. Max. memory is 8.0GB. [2022-01-10 03:45:33,647 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory was 143.3MB in the beginning and 143.2MB in the end (delta: 74.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.89ms. Allocated memory is still 176.2MB. Free memory was 126.6MB in the beginning and 153.2MB in the end (delta: -26.6MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.72ms. Allocated memory is still 176.2MB. Free memory was 153.2MB in the beginning and 151.2MB in the end (delta: 2.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.66ms. Allocated memory is still 176.2MB. Free memory was 151.2MB in the beginning and 150.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 483.82ms. Allocated memory is still 176.2MB. Free memory was 150.1MB in the beginning and 138.1MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 10168.42ms. Allocated memory was 176.2MB in the beginning and 218.1MB in the end (delta: 41.9MB). Free memory was 138.0MB in the beginning and 146.8MB in the end (delta: -8.8MB). Peak memory consumption was 34.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 61]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int x[5]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L17] COND FALSE !(i < 5) VAL [i=5, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={-9223372036854775808:0}] [L49] CALL, EXPR rangesum(x) VAL [x={-9223372036854775808:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [cnt=0, i=0, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L29] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L29] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L29] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=3, ret=1073741824, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] i++ VAL [cnt=1, i=4, ret=1073741824, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] COND TRUE i < 5 VAL [cnt=1, i=4, ret=1073741824, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=4, ret=1, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] i++ VAL [cnt=2, i=5, ret=1, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=1, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=0, cnt=2, i=5, ret=1, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L49] RET, EXPR rangesum(x) VAL [rangesum(x)=0, x={-9223372036854775808:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp VAL [ret=0, temp=0, x={-9223372036854775808:0}] [L52] CALL, EXPR rangesum(x) VAL [x={-9223372036854775808:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [cnt=0, i=0, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L29] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L29] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L29] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=3, ret=1073741824, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] i++ VAL [cnt=1, i=4, ret=1073741824, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] COND TRUE i < 5 VAL [cnt=1, i=4, ret=1073741824, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=4, ret=1, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] i++ VAL [cnt=2, i=5, ret=1, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=1, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=0, cnt=2, i=5, ret=1, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L52] RET, EXPR rangesum(x) VAL [rangesum(x)=0, ret=0, temp=0, x={-9223372036854775808:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret=0, ret2=0, temp=3221225470, x={-9223372036854775808:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret=0, ret2=0, temp=3221225470, x={-9223372036854775808:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret=0, ret2=0, temp=3221225470, x={-9223372036854775808:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret=0, ret2=0, temp=3221225470, x={-9223372036854775808:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret=0, ret2=0, temp=3221225470, x={-9223372036854775808:0}] [L54] COND FALSE !(i<5 -1) VAL [i=4, ret=0, ret2=0, temp=3221225470, x={-9223372036854775808:0}] [L57] x[5 -1] = temp VAL [i=4, ret=0, ret2=0, temp=3221225470, x={-9223372036854775808:0}] [L58] CALL, EXPR rangesum(x) VAL [x={-9223372036854775808:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [cnt=0, i=0, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L29] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L29] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L29] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=3, ret=18446744072635809793, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] i++ VAL [cnt=1, i=4, ret=18446744072635809793, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] COND TRUE i < 5 VAL [cnt=1, i=4, ret=18446744072635809793, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=4, ret=18446744071562067967, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] i++ VAL [cnt=2, i=5, ret=18446744071562067967, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L28] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=18446744071562067967, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=-1073741824, cnt=2, i=5, ret=18446744071562067967, x={-9223372036854775808:0}, x={-9223372036854775808:0}] [L58] RET, EXPR rangesum(x) VAL [i=4, rangesum(x)=-1073741824, ret=0, ret2=0, temp=3221225470, x={-9223372036854775808:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [i=4, ret=0, ret2=0, ret5=3221225472, temp=3221225470, x={-9223372036854775808:0}] [L61] reach_error() VAL [i=4, ret=0, ret2=0, ret5=3221225472, temp=3221225470, x={-9223372036854775808:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 12, TraceHistogramMax: 15, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 1053 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 745 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 304 IncrementalHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 308 mSDtfsCounter, 304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 938 GetRequests, 891 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=11, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 11 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 680 NumberOfCodeBlocks, 564 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 932 ConstructedInterpolants, 0 QuantifiedInterpolants, 1206 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1138 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 2309/2663 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-10 03:45:33,679 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...