/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain IntervalDomain -i ../sv-benchmarks/c/recursive/gcd02.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 00:01:12,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 00:01:12,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 00:01:12,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 00:01:12,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 00:01:12,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 00:01:12,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 00:01:12,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 00:01:12,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 00:01:12,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 00:01:12,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 00:01:12,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 00:01:12,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 00:01:12,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 00:01:12,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 00:01:12,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 00:01:12,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 00:01:12,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 00:01:12,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 00:01:12,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 00:01:12,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 00:01:12,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 00:01:12,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 00:01:12,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 00:01:12,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 00:01:12,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 00:01:12,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 00:01:12,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 00:01:12,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 00:01:12,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 00:01:12,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 00:01:12,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 00:01:12,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 00:01:12,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 00:01:12,154 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 00:01:12,154 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 00:01:12,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 00:01:12,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 00:01:12,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 00:01:12,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 00:01:12,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 00:01:12,171 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 00:01:12,207 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 00:01:12,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 00:01:12,208 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 00:01:12,208 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 00:01:12,225 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 00:01:12,225 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 00:01:12,226 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 00:01:12,226 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 00:01:12,226 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 00:01:12,226 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 00:01:12,227 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 00:01:12,227 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 00:01:12,227 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 00:01:12,228 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 00:01:12,228 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 00:01:12,228 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 00:01:12,228 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 00:01:12,228 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 00:01:12,229 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 00:01:12,229 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 00:01:12,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 00:01:12,229 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 00:01:12,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 00:01:12,230 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 00:01:12,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 00:01:12,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 00:01:12,230 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 00:01:12,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 00:01:12,231 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 00:01:12,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 00:01:12,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 00:01:12,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 00:01:12,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 00:01:12,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 00:01:12,232 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 00:01:12,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 00:01:12,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 00:01:12,232 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 00:01:12,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 00:01:12,232 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 00:01:12,233 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 00:01:12,233 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.sifa: Abstract Domain -> IntervalDomain [2023-04-01 00:01:12,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 00:01:12,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 00:01:12,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 00:01:12,681 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 00:01:12,681 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 00:01:12,682 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/gcd02.c [2023-04-01 00:01:14,613 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 00:01:14,956 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 00:01:14,957 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/gcd02.c [2023-04-01 00:01:14,962 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/040a114a7/6aa0748cbac94a5794e220313f7d0370/FLAG161c22f73 [2023-04-01 00:01:14,993 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/040a114a7/6aa0748cbac94a5794e220313f7d0370 [2023-04-01 00:01:14,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 00:01:14,997 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 00:01:14,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 00:01:15,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 00:01:15,003 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 00:01:15,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:01:14" (1/1) ... [2023-04-01 00:01:15,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f27dc35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:15, skipping insertion in model container [2023-04-01 00:01:15,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:01:14" (1/1) ... [2023-04-01 00:01:15,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 00:01:15,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 00:01:15,307 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/gcd02.c[623,636] [2023-04-01 00:01:15,328 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/gcd02.c[1283,1296] [2023-04-01 00:01:15,329 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 00:01:15,354 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 00:01:15,375 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/gcd02.c[623,636] [2023-04-01 00:01:15,387 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/gcd02.c[1283,1296] [2023-04-01 00:01:15,388 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 00:01:15,399 INFO L208 MainTranslator]: Completed translation [2023-04-01 00:01:15,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:15 WrapperNode [2023-04-01 00:01:15,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 00:01:15,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 00:01:15,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 00:01:15,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 00:01:15,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:15" (1/1) ... [2023-04-01 00:01:15,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:15" (1/1) ... [2023-04-01 00:01:15,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:15" (1/1) ... [2023-04-01 00:01:15,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:15" (1/1) ... [2023-04-01 00:01:15,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:15" (1/1) ... [2023-04-01 00:01:15,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:15" (1/1) ... [2023-04-01 00:01:15,476 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:15" (1/1) ... [2023-04-01 00:01:15,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:15" (1/1) ... [2023-04-01 00:01:15,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 00:01:15,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 00:01:15,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 00:01:15,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 00:01:15,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:15" (1/1) ... [2023-04-01 00:01:15,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 00:01:15,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:15,622 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) [2023-04-01 00:01:15,660 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 [2023-04-01 00:01:15,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 00:01:15,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 00:01:15,700 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 00:01:15,700 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2023-04-01 00:01:15,700 INFO L138 BoogieDeclarations]: Found implementation of procedure divides [2023-04-01 00:01:15,701 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 00:01:15,701 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 00:01:15,701 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 00:01:15,701 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 00:01:15,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 00:01:15,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 00:01:15,701 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2023-04-01 00:01:15,701 INFO L130 BoogieDeclarations]: Found specification of procedure divides [2023-04-01 00:01:15,701 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 00:01:15,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 00:01:15,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 00:01:15,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 00:01:15,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 00:01:15,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 00:01:15,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 00:01:15,801 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 00:01:15,803 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 00:01:16,145 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 00:01:16,201 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 00:01:16,201 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-01 00:01:16,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:01:16 BoogieIcfgContainer [2023-04-01 00:01:16,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 00:01:16,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 00:01:16,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 00:01:16,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 00:01:16,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 12:01:14" (1/3) ... [2023-04-01 00:01:16,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53af3f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:01:16, skipping insertion in model container [2023-04-01 00:01:16,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:15" (2/3) ... [2023-04-01 00:01:16,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53af3f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:01:16, skipping insertion in model container [2023-04-01 00:01:16,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:01:16" (3/3) ... [2023-04-01 00:01:16,221 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd02.c [2023-04-01 00:01:16,253 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 00:01:16,253 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-04-01 00:01:16,358 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 00:01:16,364 INFO L357 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=FINITE_AUTOMATA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@16dde473, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 00:01:16,365 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-04-01 00:01:16,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 26 states have internal predecessors, (35), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-01 00:01:16,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-04-01 00:01:16,397 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:16,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:16,399 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:16,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:16,407 INFO L85 PathProgramCache]: Analyzing trace with hash -325229112, now seen corresponding path program 1 times [2023-04-01 00:01:16,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:16,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830251132] [2023-04-01 00:01:16,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:16,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:17,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:01:17,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:17,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830251132] [2023-04-01 00:01:17,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830251132] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:17,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:17,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-01 00:01:17,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357672229] [2023-04-01 00:01:17,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:17,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 00:01:17,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:17,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 00:01:17,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-04-01 00:01:17,137 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 26 states have internal predecessors, (35), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 00:01:17,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:17,355 INFO L93 Difference]: Finished difference Result 81 states and 108 transitions. [2023-04-01 00:01:17,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 00:01:17,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-04-01 00:01:17,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:17,380 INFO L225 Difference]: With dead ends: 81 [2023-04-01 00:01:17,380 INFO L226 Difference]: Without dead ends: 44 [2023-04-01 00:01:17,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-04-01 00:01:17,387 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 32 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:17,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 151 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:17,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-04-01 00:01:17,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-04-01 00:01:17,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-04-01 00:01:17,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2023-04-01 00:01:17,477 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 12 [2023-04-01 00:01:17,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:17,478 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2023-04-01 00:01:17,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 00:01:17,479 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2023-04-01 00:01:17,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-04-01 00:01:17,480 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:17,480 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:17,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 00:01:17,481 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:17,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:17,482 INFO L85 PathProgramCache]: Analyzing trace with hash 864445861, now seen corresponding path program 1 times [2023-04-01 00:01:17,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:17,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623002793] [2023-04-01 00:01:17,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:17,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:01:17,735 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:17,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623002793] [2023-04-01 00:01:17,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623002793] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:17,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:17,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-01 00:01:17,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529660688] [2023-04-01 00:01:17,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:17,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 00:01:17,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:17,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 00:01:17,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-04-01 00:01:17,744 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 00:01:17,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:17,907 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2023-04-01 00:01:17,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 00:01:17,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-04-01 00:01:17,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:17,920 INFO L225 Difference]: With dead ends: 62 [2023-04-01 00:01:17,920 INFO L226 Difference]: Without dead ends: 60 [2023-04-01 00:01:17,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-04-01 00:01:17,921 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 20 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:17,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 128 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:17,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-04-01 00:01:17,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2023-04-01 00:01:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-04-01 00:01:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2023-04-01 00:01:17,954 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 17 [2023-04-01 00:01:17,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:17,955 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2023-04-01 00:01:17,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 00:01:17,955 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2023-04-01 00:01:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-04-01 00:01:17,956 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:17,956 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:17,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 00:01:17,956 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:17,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:17,957 INFO L85 PathProgramCache]: Analyzing trace with hash 867276006, now seen corresponding path program 1 times [2023-04-01 00:01:17,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:17,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157899214] [2023-04-01 00:01:17,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:17,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:18,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:01:18,188 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:18,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157899214] [2023-04-01 00:01:18,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157899214] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:18,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:18,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-01 00:01:18,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798951501] [2023-04-01 00:01:18,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:18,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-01 00:01:18,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:18,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-01 00:01:18,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-04-01 00:01:18,193 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 00:01:18,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:18,364 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2023-04-01 00:01:18,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 00:01:18,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-04-01 00:01:18,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:18,369 INFO L225 Difference]: With dead ends: 66 [2023-04-01 00:01:18,369 INFO L226 Difference]: Without dead ends: 64 [2023-04-01 00:01:18,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-04-01 00:01:18,375 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 22 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:18,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 131 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:18,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-04-01 00:01:18,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2023-04-01 00:01:18,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-04-01 00:01:18,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2023-04-01 00:01:18,405 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 17 [2023-04-01 00:01:18,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:18,405 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2023-04-01 00:01:18,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 00:01:18,405 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2023-04-01 00:01:18,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-04-01 00:01:18,423 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:18,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:18,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-01 00:01:18,423 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:18,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:18,426 INFO L85 PathProgramCache]: Analyzing trace with hash 450986041, now seen corresponding path program 1 times [2023-04-01 00:01:18,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:18,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168594862] [2023-04-01 00:01:18,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:18,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:18,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:01:18,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:18,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168594862] [2023-04-01 00:01:18,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168594862] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:18,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:18,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 00:01:18,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954848964] [2023-04-01 00:01:18,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:18,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 00:01:18,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:18,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 00:01:18,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 00:01:18,582 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-01 00:01:18,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:18,637 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2023-04-01 00:01:18,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 00:01:18,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-04-01 00:01:18,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:18,640 INFO L225 Difference]: With dead ends: 58 [2023-04-01 00:01:18,641 INFO L226 Difference]: Without dead ends: 54 [2023-04-01 00:01:18,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-01 00:01:18,647 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:18,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 99 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:18,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-04-01 00:01:18,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-04-01 00:01:18,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 37 states have internal predecessors, (44), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-04-01 00:01:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2023-04-01 00:01:18,673 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 23 [2023-04-01 00:01:18,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:18,673 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2023-04-01 00:01:18,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-01 00:01:18,674 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2023-04-01 00:01:18,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-04-01 00:01:18,684 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:18,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:18,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-01 00:01:18,685 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:18,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:18,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1859593096, now seen corresponding path program 1 times [2023-04-01 00:01:18,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:18,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655453245] [2023-04-01 00:01:18,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:18,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:01:18,881 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:18,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655453245] [2023-04-01 00:01:18,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655453245] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:18,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:18,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-04-01 00:01:18,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036468525] [2023-04-01 00:01:18,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:18,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-01 00:01:18,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:18,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-01 00:01:18,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-04-01 00:01:18,885 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-01 00:01:19,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:19,083 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2023-04-01 00:01:19,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 00:01:19,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-04-01 00:01:19,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:19,087 INFO L225 Difference]: With dead ends: 72 [2023-04-01 00:01:19,089 INFO L226 Difference]: Without dead ends: 68 [2023-04-01 00:01:19,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-04-01 00:01:19,091 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:19,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 132 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 00:01:19,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-04-01 00:01:19,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2023-04-01 00:01:19,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.205128205128205) internal successors, (47), 42 states have internal predecessors, (47), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2023-04-01 00:01:19,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2023-04-01 00:01:19,125 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 24 [2023-04-01 00:01:19,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:19,126 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2023-04-01 00:01:19,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-01 00:01:19,126 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2023-04-01 00:01:19,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-04-01 00:01:19,127 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:19,127 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:19,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-01 00:01:19,127 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:19,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:19,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2056647740, now seen corresponding path program 1 times [2023-04-01 00:01:19,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:19,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375460543] [2023-04-01 00:01:19,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:19,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 00:01:19,228 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:19,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375460543] [2023-04-01 00:01:19,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375460543] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:19,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:19,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 00:01:19,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842897849] [2023-04-01 00:01:19,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:19,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 00:01:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:19,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 00:01:19,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 00:01:19,230 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2023-04-01 00:01:19,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:19,267 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2023-04-01 00:01:19,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 00:01:19,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2023-04-01 00:01:19,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:19,269 INFO L225 Difference]: With dead ends: 67 [2023-04-01 00:01:19,269 INFO L226 Difference]: Without dead ends: 58 [2023-04-01 00:01:19,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 00:01:19,270 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:19,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:19,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-04-01 00:01:19,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-04-01 00:01:19,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-01 00:01:19,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2023-04-01 00:01:19,297 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 30 [2023-04-01 00:01:19,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:19,297 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2023-04-01 00:01:19,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2023-04-01 00:01:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2023-04-01 00:01:19,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-04-01 00:01:19,300 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:19,300 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:19,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-04-01 00:01:19,300 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:19,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:19,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1727529807, now seen corresponding path program 1 times [2023-04-01 00:01:19,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:19,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703690561] [2023-04-01 00:01:19,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:19,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:19,734 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 00:01:19,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:19,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703690561] [2023-04-01 00:01:19,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703690561] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:19,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063346172] [2023-04-01 00:01:19,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:19,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:19,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:19,746 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:19,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 00:01:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:19,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2023-04-01 00:01:19,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 00:01:20,039 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 00:01:20,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063346172] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:20,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1177307327] [2023-04-01 00:01:20,399 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2023-04-01 00:01:20,399 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:20,407 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:20,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:20,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 14 [2023-04-01 00:01:20,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271235610] [2023-04-01 00:01:20,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:20,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-01 00:01:20,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:20,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-01 00:01:20,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-04-01 00:01:20,426 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-04-01 00:01:20,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:20,645 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2023-04-01 00:01:20,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 00:01:20,646 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 31 [2023-04-01 00:01:20,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:20,648 INFO L225 Difference]: With dead ends: 66 [2023-04-01 00:01:20,648 INFO L226 Difference]: Without dead ends: 58 [2023-04-01 00:01:20,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-04-01 00:01:20,649 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 19 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:20,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 152 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:20,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-04-01 00:01:20,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2023-04-01 00:01:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-04-01 00:01:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2023-04-01 00:01:20,664 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 31 [2023-04-01 00:01:20,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:20,664 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2023-04-01 00:01:20,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-04-01 00:01:20,664 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2023-04-01 00:01:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-04-01 00:01:20,666 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:20,667 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:20,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:20,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:20,874 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:20,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:20,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2143867452, now seen corresponding path program 1 times [2023-04-01 00:01:20,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:20,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80126112] [2023-04-01 00:01:20,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:20,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:21,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 00:01:21,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:21,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80126112] [2023-04-01 00:01:21,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80126112] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:21,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444759006] [2023-04-01 00:01:21,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:21,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:21,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:21,188 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:21,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 00:01:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:21,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 15 conjunts are in the unsatisfiable core [2023-04-01 00:01:21,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:21,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-01 00:01:21,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 00:01:21,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444759006] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:21,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [745550274] [2023-04-01 00:01:21,865 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:01:21,865 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:21,866 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:21,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:21,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 20 [2023-04-01 00:01:21,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39173595] [2023-04-01 00:01:21,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:21,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-04-01 00:01:21,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:21,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-04-01 00:01:21,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2023-04-01 00:01:21,869 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 20 states, 18 states have (on average 2.111111111111111) internal successors, (38), 16 states have internal predecessors, (38), 6 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-04-01 00:01:22,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:22,157 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2023-04-01 00:01:22,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 00:01:22,158 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.111111111111111) internal successors, (38), 16 states have internal predecessors, (38), 6 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 32 [2023-04-01 00:01:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:22,159 INFO L225 Difference]: With dead ends: 77 [2023-04-01 00:01:22,159 INFO L226 Difference]: Without dead ends: 73 [2023-04-01 00:01:22,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2023-04-01 00:01:22,163 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:22,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 229 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 00:01:22,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-04-01 00:01:22,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 62. [2023-04-01 00:01:22,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.146341463414634) internal successors, (47), 42 states have internal predecessors, (47), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) [2023-04-01 00:01:22,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2023-04-01 00:01:22,191 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 32 [2023-04-01 00:01:22,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:22,191 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2023-04-01 00:01:22,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.111111111111111) internal successors, (38), 16 states have internal predecessors, (38), 6 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-04-01 00:01:22,191 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2023-04-01 00:01:22,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-04-01 00:01:22,192 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:22,192 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:22,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:22,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-04-01 00:01:22,398 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:22,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:22,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1632092060, now seen corresponding path program 1 times [2023-04-01 00:01:22,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:22,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161920638] [2023-04-01 00:01:22,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:22,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:22,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 00:01:22,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:22,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161920638] [2023-04-01 00:01:22,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161920638] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:22,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:22,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-01 00:01:22,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327544745] [2023-04-01 00:01:22,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:22,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 00:01:22,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:22,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 00:01:22,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-04-01 00:01:22,674 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-01 00:01:22,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:22,859 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2023-04-01 00:01:22,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 00:01:22,860 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2023-04-01 00:01:22,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:22,864 INFO L225 Difference]: With dead ends: 83 [2023-04-01 00:01:22,864 INFO L226 Difference]: Without dead ends: 79 [2023-04-01 00:01:22,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-04-01 00:01:22,866 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:22,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 150 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:22,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-04-01 00:01:22,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2023-04-01 00:01:22,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 12 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (20), 15 states have call predecessors, (20), 11 states have call successors, (20) [2023-04-01 00:01:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2023-04-01 00:01:22,883 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 32 [2023-04-01 00:01:22,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:22,884 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2023-04-01 00:01:22,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-01 00:01:22,884 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2023-04-01 00:01:22,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-01 00:01:22,885 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:22,885 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:22,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-04-01 00:01:22,885 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:22,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:22,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1413864933, now seen corresponding path program 1 times [2023-04-01 00:01:22,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:22,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902274414] [2023-04-01 00:01:22,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:22,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-01 00:01:23,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:23,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902274414] [2023-04-01 00:01:23,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902274414] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:23,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557250039] [2023-04-01 00:01:23,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:23,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:23,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:23,216 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:23,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 00:01:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:23,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 21 conjunts are in the unsatisfiable core [2023-04-01 00:01:23,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 00:01:23,538 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:24,300 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-01 00:01:24,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557250039] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:24,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [289519715] [2023-04-01 00:01:24,305 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2023-04-01 00:01:24,305 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:24,306 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:24,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:24,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 21 [2023-04-01 00:01:24,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817756330] [2023-04-01 00:01:24,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:24,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-04-01 00:01:24,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:24,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-04-01 00:01:24,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2023-04-01 00:01:24,317 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 21 states, 20 states have (on average 2.65) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-01 00:01:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:24,721 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2023-04-01 00:01:24,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 00:01:24,722 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.65) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) Word has length 39 [2023-04-01 00:01:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:24,723 INFO L225 Difference]: With dead ends: 92 [2023-04-01 00:01:24,723 INFO L226 Difference]: Without dead ends: 88 [2023-04-01 00:01:24,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 64 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2023-04-01 00:01:24,724 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 49 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:24,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 260 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 00:01:24,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-04-01 00:01:24,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2023-04-01 00:01:24,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.12) internal successors, (56), 51 states have internal predecessors, (56), 13 states have call successors, (13), 6 states have call predecessors, (13), 12 states have return successors, (28), 18 states have call predecessors, (28), 12 states have call successors, (28) [2023-04-01 00:01:24,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2023-04-01 00:01:24,730 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 39 [2023-04-01 00:01:24,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:24,730 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2023-04-01 00:01:24,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.65) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-01 00:01:24,730 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2023-04-01 00:01:24,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-01 00:01:24,745 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:24,746 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:24,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:24,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:24,951 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:24,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:24,951 INFO L85 PathProgramCache]: Analyzing trace with hash 729245883, now seen corresponding path program 1 times [2023-04-01 00:01:24,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:24,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807418242] [2023-04-01 00:01:24,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:24,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 00:01:25,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:25,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807418242] [2023-04-01 00:01:25,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807418242] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:25,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932639167] [2023-04-01 00:01:25,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:25,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:25,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:25,234 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:25,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 00:01:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:25,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 31 conjunts are in the unsatisfiable core [2023-04-01 00:01:25,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 00:01:25,409 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 00:01:25,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932639167] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:25,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [105064589] [2023-04-01 00:01:25,694 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2023-04-01 00:01:25,694 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:25,694 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:25,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:25,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 16 [2023-04-01 00:01:25,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357273864] [2023-04-01 00:01:25,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:25,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-01 00:01:25,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:25,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-01 00:01:25,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-04-01 00:01:25,697 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 16 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2023-04-01 00:01:25,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:25,879 INFO L93 Difference]: Finished difference Result 87 states and 111 transitions. [2023-04-01 00:01:25,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-01 00:01:25,880 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 39 [2023-04-01 00:01:25,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:25,882 INFO L225 Difference]: With dead ends: 87 [2023-04-01 00:01:25,882 INFO L226 Difference]: Without dead ends: 78 [2023-04-01 00:01:25,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2023-04-01 00:01:25,884 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:25,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 172 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:25,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-04-01 00:01:25,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2023-04-01 00:01:25,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 51 states have internal predecessors, (55), 13 states have call successors, (13), 6 states have call predecessors, (13), 12 states have return successors, (27), 17 states have call predecessors, (27), 12 states have call successors, (27) [2023-04-01 00:01:25,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2023-04-01 00:01:25,898 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 39 [2023-04-01 00:01:25,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:25,898 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2023-04-01 00:01:25,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2023-04-01 00:01:25,899 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2023-04-01 00:01:25,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-04-01 00:01:25,900 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:25,900 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:25,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:26,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:26,106 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:26,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:26,107 INFO L85 PathProgramCache]: Analyzing trace with hash -100230488, now seen corresponding path program 1 times [2023-04-01 00:01:26,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:26,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676595523] [2023-04-01 00:01:26,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:26,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:26,327 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 00:01:26,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:26,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676595523] [2023-04-01 00:01:26,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676595523] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:26,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588820458] [2023-04-01 00:01:26,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:26,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:26,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:26,330 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:26,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 00:01:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:26,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 21 conjunts are in the unsatisfiable core [2023-04-01 00:01:26,406 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:26,665 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 00:01:26,665 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:27,272 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 00:01:27,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588820458] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:27,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1739645635] [2023-04-01 00:01:27,276 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2023-04-01 00:01:27,277 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:27,277 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:27,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:27,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 31 [2023-04-01 00:01:27,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812039979] [2023-04-01 00:01:27,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:27,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-04-01 00:01:27,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:27,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-04-01 00:01:27,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2023-04-01 00:01:27,281 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand has 31 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 8 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (12), 10 states have call predecessors, (12), 8 states have call successors, (12) [2023-04-01 00:01:27,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:27,863 INFO L93 Difference]: Finished difference Result 124 states and 162 transitions. [2023-04-01 00:01:27,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-04-01 00:01:27,864 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 8 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (12), 10 states have call predecessors, (12), 8 states have call successors, (12) Word has length 40 [2023-04-01 00:01:27,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:27,866 INFO L225 Difference]: With dead ends: 124 [2023-04-01 00:01:27,866 INFO L226 Difference]: Without dead ends: 120 [2023-04-01 00:01:27,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=1584, Unknown=0, NotChecked=0, Total=1806 [2023-04-01 00:01:27,867 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 73 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:27,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 397 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 00:01:27,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-04-01 00:01:27,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 83. [2023-04-01 00:01:27,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 13 states have call successors, (13), 6 states have call predecessors, (13), 15 states have return successors, (35), 19 states have call predecessors, (35), 12 states have call successors, (35) [2023-04-01 00:01:27,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 108 transitions. [2023-04-01 00:01:27,876 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 108 transitions. Word has length 40 [2023-04-01 00:01:27,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:27,877 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 108 transitions. [2023-04-01 00:01:27,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 8 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (12), 10 states have call predecessors, (12), 8 states have call successors, (12) [2023-04-01 00:01:27,877 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 108 transitions. [2023-04-01 00:01:27,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-04-01 00:01:27,878 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:27,878 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:27,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:28,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-04-01 00:01:28,084 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:28,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:28,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1665736088, now seen corresponding path program 2 times [2023-04-01 00:01:28,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:28,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323017362] [2023-04-01 00:01:28,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:28,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-04-01 00:01:28,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:28,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323017362] [2023-04-01 00:01:28,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323017362] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:28,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059720841] [2023-04-01 00:01:28,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:01:28,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:28,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:28,324 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:28,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-01 00:01:28,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-01 00:01:28,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:28,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 22 conjunts are in the unsatisfiable core [2023-04-01 00:01:28,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-04-01 00:01:28,687 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 00:01:29,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059720841] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:29,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1923623570] [2023-04-01 00:01:29,697 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2023-04-01 00:01:29,698 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:29,698 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:29,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:29,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 33 [2023-04-01 00:01:29,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353585350] [2023-04-01 00:01:29,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:29,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-04-01 00:01:29,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:29,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-04-01 00:01:29,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=959, Unknown=0, NotChecked=0, Total=1056 [2023-04-01 00:01:29,702 INFO L87 Difference]: Start difference. First operand 83 states and 108 transitions. Second operand has 33 states, 30 states have (on average 2.1) internal successors, (63), 24 states have internal predecessors, (63), 10 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2023-04-01 00:01:30,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:30,328 INFO L93 Difference]: Finished difference Result 122 states and 162 transitions. [2023-04-01 00:01:30,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-01 00:01:30,329 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.1) internal successors, (63), 24 states have internal predecessors, (63), 10 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) Word has length 40 [2023-04-01 00:01:30,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:30,330 INFO L225 Difference]: With dead ends: 122 [2023-04-01 00:01:30,330 INFO L226 Difference]: Without dead ends: 118 [2023-04-01 00:01:30,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=1455, Unknown=0, NotChecked=0, Total=1640 [2023-04-01 00:01:30,332 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:30,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 317 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 00:01:30,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-04-01 00:01:30,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2023-04-01 00:01:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 59 states have internal predecessors, (65), 13 states have call successors, (13), 6 states have call predecessors, (13), 16 states have return successors, (38), 23 states have call predecessors, (38), 12 states have call successors, (38) [2023-04-01 00:01:30,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 116 transitions. [2023-04-01 00:01:30,341 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 116 transitions. Word has length 40 [2023-04-01 00:01:30,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:30,341 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 116 transitions. [2023-04-01 00:01:30,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.1) internal successors, (63), 24 states have internal predecessors, (63), 10 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2023-04-01 00:01:30,342 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 116 transitions. [2023-04-01 00:01:30,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-04-01 00:01:30,343 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:30,344 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:30,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:30,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:30,550 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:30,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:30,551 INFO L85 PathProgramCache]: Analyzing trace with hash -886479250, now seen corresponding path program 2 times [2023-04-01 00:01:30,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:30,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110746976] [2023-04-01 00:01:30,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:30,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:31,132 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 00:01:31,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:31,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110746976] [2023-04-01 00:01:31,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110746976] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:31,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731792048] [2023-04-01 00:01:31,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:01:31,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:31,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:31,137 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:31,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-01 00:01:31,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-01 00:01:31,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:31,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 31 conjunts are in the unsatisfiable core [2023-04-01 00:01:31,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:31,619 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 00:01:31,619 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 00:01:33,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731792048] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:33,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1019336008] [2023-04-01 00:01:33,438 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2023-04-01 00:01:33,438 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:33,439 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:33,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:33,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 18] total 29 [2023-04-01 00:01:33,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323125654] [2023-04-01 00:01:33,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:33,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-04-01 00:01:33,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:33,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-04-01 00:01:33,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2023-04-01 00:01:33,442 INFO L87 Difference]: Start difference. First operand 89 states and 116 transitions. Second operand has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 25 states have internal predecessors, (71), 12 states have call successors, (14), 1 states have call predecessors, (14), 9 states have return successors, (15), 8 states have call predecessors, (15), 12 states have call successors, (15) [2023-04-01 00:01:34,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:34,063 INFO L93 Difference]: Finished difference Result 117 states and 156 transitions. [2023-04-01 00:01:34,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-01 00:01:34,064 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 25 states have internal predecessors, (71), 12 states have call successors, (14), 1 states have call predecessors, (14), 9 states have return successors, (15), 8 states have call predecessors, (15), 12 states have call successors, (15) Word has length 54 [2023-04-01 00:01:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:34,065 INFO L225 Difference]: With dead ends: 117 [2023-04-01 00:01:34,065 INFO L226 Difference]: Without dead ends: 113 [2023-04-01 00:01:34,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 88 SyntacticMatches, 10 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=161, Invalid=1171, Unknown=0, NotChecked=0, Total=1332 [2023-04-01 00:01:34,067 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 81 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:34,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 467 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 00:01:34,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-04-01 00:01:34,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 100. [2023-04-01 00:01:34,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 66 states have internal predecessors, (72), 14 states have call successors, (14), 6 states have call predecessors, (14), 19 states have return successors, (48), 27 states have call predecessors, (48), 13 states have call successors, (48) [2023-04-01 00:01:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 134 transitions. [2023-04-01 00:01:34,078 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 134 transitions. Word has length 54 [2023-04-01 00:01:34,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:34,079 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 134 transitions. [2023-04-01 00:01:34,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 25 states have internal predecessors, (71), 12 states have call successors, (14), 1 states have call predecessors, (14), 9 states have return successors, (15), 8 states have call predecessors, (15), 12 states have call successors, (15) [2023-04-01 00:01:34,079 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 134 transitions. [2023-04-01 00:01:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-04-01 00:01:34,080 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:34,080 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:34,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:34,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:34,281 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:34,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:34,281 INFO L85 PathProgramCache]: Analyzing trace with hash 443999502, now seen corresponding path program 1 times [2023-04-01 00:01:34,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:34,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051391484] [2023-04-01 00:01:34,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:34,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:34,817 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 00:01:34,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:34,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051391484] [2023-04-01 00:01:34,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051391484] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:34,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163686523] [2023-04-01 00:01:34,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:34,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:34,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:34,841 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:34,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-01 00:01:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:34,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 31 conjunts are in the unsatisfiable core [2023-04-01 00:01:34,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:35,119 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 00:01:35,119 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:52,797 WARN L223 SmtUtils]: Spent 6.14s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-01 00:02:30,694 WARN L223 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 44 DAG size of output: 30 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)