/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/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 02:05:18,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 02:05:18,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 02:05:18,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 02:05:18,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 02:05:18,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 02:05:18,656 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 02:05:18,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 02:05:18,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 02:05:18,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 02:05:18,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 02:05:18,665 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 02:05:18,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 02:05:18,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 02:05:18,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 02:05:18,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 02:05:18,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 02:05:18,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 02:05:18,674 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 02:05:18,678 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 02:05:18,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 02:05:18,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 02:05:18,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 02:05:18,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 02:05:18,687 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 02:05:18,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 02:05:18,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 02:05:18,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 02:05:18,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 02:05:18,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 02:05:18,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 02:05:18,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 02:05:18,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 02:05:18,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 02:05:18,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 02:05:18,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 02:05:18,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 02:05:18,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 02:05:18,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 02:05:18,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 02:05:18,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 02:05:18,694 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-04-02 02:05:18,722 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 02:05:18,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 02:05:18,722 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 02:05:18,722 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 02:05:18,723 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 02:05:18,723 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 02:05:18,724 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-02 02:05:18,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-02 02:05:18,724 INFO L138 SettingsManager]: * Use SBE=true [2023-04-02 02:05:18,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 02:05:18,725 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 02:05:18,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 02:05:18,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 02:05:18,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 02:05:18,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 02:05:18,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 02:05:18,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 02:05:18,725 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 02:05:18,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 02:05:18,725 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 02:05:18,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 02:05:18,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 02:05:18,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-02 02:05:18,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 02:05:18,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 02:05:18,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 02:05:18,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 02:05:18,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 02:05:18,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-02 02:05:18,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 02:05:18,726 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-02 02:05:18,726 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 02:05:18,727 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-02 02:05:18,727 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-02 02:05:18,727 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-02 02:05:18,727 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-04-02 02:05:18,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 02:05:18,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 02:05:18,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 02:05:18,937 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 02:05:18,937 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 02:05:18,938 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound10.c [2023-04-02 02:05:20,004 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 02:05:20,245 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 02:05:20,246 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound10.c [2023-04-02 02:05:20,249 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef940c506/a56ff1de5cb64e09ac74e6d379a0f3ad/FLAGe24402d19 [2023-04-02 02:05:20,258 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef940c506/a56ff1de5cb64e09ac74e6d379a0f3ad [2023-04-02 02:05:20,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 02:05:20,261 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 02:05:20,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 02:05:20,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 02:05:20,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 02:05:20,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 02:05:20" (1/1) ... [2023-04-02 02:05:20,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a92ee68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:05:20, skipping insertion in model container [2023-04-02 02:05:20,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 02:05:20" (1/1) ... [2023-04-02 02:05:20,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 02:05:20,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 02:05:20,374 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/nla-digbench-scaling/egcd-ll_unwindbound10.c[489,502] [2023-04-02 02:05:20,387 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 02:05:20,393 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 02:05:20,402 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/nla-digbench-scaling/egcd-ll_unwindbound10.c[489,502] [2023-04-02 02:05:20,413 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 02:05:20,422 INFO L208 MainTranslator]: Completed translation [2023-04-02 02:05:20,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:05:20 WrapperNode [2023-04-02 02:05:20,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 02:05:20,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 02:05:20,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 02:05:20,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 02:05:20,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:05:20" (1/1) ... [2023-04-02 02:05:20,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:05:20" (1/1) ... [2023-04-02 02:05:20,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:05:20" (1/1) ... [2023-04-02 02:05:20,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:05:20" (1/1) ... [2023-04-02 02:05:20,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:05:20" (1/1) ... [2023-04-02 02:05:20,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:05:20" (1/1) ... [2023-04-02 02:05:20,442 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:05:20" (1/1) ... [2023-04-02 02:05:20,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:05:20" (1/1) ... [2023-04-02 02:05:20,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 02:05:20,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 02:05:20,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 02:05:20,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 02:05:20,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:05:20" (1/1) ... [2023-04-02 02:05:20,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 02:05:20,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 02:05:20,463 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-02 02:05:20,479 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-02 02:05:20,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 02:05:20,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 02:05:20,487 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 02:05:20,488 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-02 02:05:20,488 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-02 02:05:20,488 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 02:05:20,488 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 02:05:20,488 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 02:05:20,488 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 02:05:20,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 02:05:20,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 02:05:20,488 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-02 02:05:20,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-02 02:05:20,488 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 02:05:20,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 02:05:20,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 02:05:20,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 02:05:20,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 02:05:20,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 02:05:20,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 02:05:20,540 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 02:05:20,541 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 02:05:20,662 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 02:05:20,665 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 02:05:20,666 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-02 02:05:20,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 02:05:20 BoogieIcfgContainer [2023-04-02 02:05:20,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 02:05:20,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 02:05:20,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 02:05:20,670 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 02:05:20,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 02:05:20" (1/3) ... [2023-04-02 02:05:20,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2a66fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 02:05:20, skipping insertion in model container [2023-04-02 02:05:20,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:05:20" (2/3) ... [2023-04-02 02:05:20,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2a66fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 02:05:20, skipping insertion in model container [2023-04-02 02:05:20,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 02:05:20" (3/3) ... [2023-04-02 02:05:20,672 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound10.c [2023-04-02 02:05:20,683 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 02:05:20,683 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 02:05:20,711 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 02:05:20,716 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@920fd5e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-02 02:05:20,716 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 02:05:20,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-04-02 02:05:20,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-04-02 02:05:20,724 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 02:05:20,724 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 02:05:20,725 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 02:05:20,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 02:05:20,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1226702723, now seen corresponding path program 1 times [2023-04-02 02:05:20,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 02:05:20,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283258279] [2023-04-02 02:05:20,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:05:20,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 02:05:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 02:05:20,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 02:05:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 02:05:20,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 02:05:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 02:05:20,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 02:05:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 02:05:20,905 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-02 02:05:20,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 02:05:20,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283258279] [2023-04-02 02:05:20,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283258279] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 02:05:20,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 02:05:20,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-02 02:05:20,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022450683] [2023-04-02 02:05:20,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 02:05:20,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 02:05:20,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 02:05:20,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 02:05:20,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 02:05:20,976 INFO L87 Difference]: Start difference. First operand has 35 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-02 02:05:21,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 02:05:21,097 INFO L93 Difference]: Finished difference Result 64 states and 97 transitions. [2023-04-02 02:05:21,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 02:05:21,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2023-04-02 02:05:21,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 02:05:21,105 INFO L225 Difference]: With dead ends: 64 [2023-04-02 02:05:21,105 INFO L226 Difference]: Without dead ends: 31 [2023-04-02 02:05:21,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 02:05:21,109 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 02:05:21,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 33 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 02:05:21,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-04-02 02:05:21,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2023-04-02 02:05:21,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-04-02 02:05:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2023-04-02 02:05:21,152 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 22 [2023-04-02 02:05:21,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 02:05:21,153 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2023-04-02 02:05:21,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-02 02:05:21,153 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2023-04-02 02:05:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-04-02 02:05:21,156 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 02:05:21,156 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] [2023-04-02 02:05:21,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 02:05:21,157 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 02:05:21,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 02:05:21,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1346542817, now seen corresponding path program 1 times [2023-04-02 02:05:21,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 02:05:21,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172802661] [2023-04-02 02:05:21,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:05:21,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 02:05:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 02:05:21,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 02:05:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 02:05:21,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 02:05:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 02:05:21,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 02:05:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 02:05:21,369 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-02 02:05:21,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 02:05:21,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172802661] [2023-04-02 02:05:21,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172802661] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 02:05:21,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 02:05:21,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-02 02:05:21,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831058548] [2023-04-02 02:05:21,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 02:05:21,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 02:05:21,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 02:05:21,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 02:05:21,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-02 02:05:21,371 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-02 02:05:21,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 02:05:21,462 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2023-04-02 02:05:21,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 02:05:21,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-04-02 02:05:21,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 02:05:21,463 INFO L225 Difference]: With dead ends: 42 [2023-04-02 02:05:21,463 INFO L226 Difference]: Without dead ends: 32 [2023-04-02 02:05:21,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-02 02:05:21,465 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 02:05:21,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 53 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 02:05:21,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-04-02 02:05:21,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-04-02 02:05:21,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-04-02 02:05:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2023-04-02 02:05:21,476 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2023-04-02 02:05:21,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 02:05:21,477 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-04-02 02:05:21,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-02 02:05:21,477 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2023-04-02 02:05:21,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-04-02 02:05:21,477 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 02:05:21,477 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] [2023-04-02 02:05:21,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-02 02:05:21,478 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 02:05:21,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 02:05:21,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1348211113, now seen corresponding path program 1 times [2023-04-02 02:05:21,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 02:05:21,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041235007] [2023-04-02 02:05:21,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:05:21,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 02:05:21,502 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 02:05:21,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [37458666] [2023-04-02 02:05:21,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:05:21,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:05:21,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 02:05:21,509 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-02 02:05:21,511 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-02 02:05:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 02:05:21,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2023-04-02 02:05:21,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 02:05:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 02:05:21,691 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 02:05:21,796 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-02 02:05:21,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 02:05:21,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041235007] [2023-04-02 02:05:21,796 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 02:05:21,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37458666] [2023-04-02 02:05:21,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37458666] provided 1 perfect and 1 imperfect interpolant sequences [2023-04-02 02:05:21,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-02 02:05:21,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-04-02 02:05:21,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106415612] [2023-04-02 02:05:21,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 02:05:21,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 02:05:21,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 02:05:21,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 02:05:21,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-04-02 02:05:21,798 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-02 02:05:22,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 02:05:22,461 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2023-04-02 02:05:22,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 02:05:22,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2023-04-02 02:05:22,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 02:05:22,462 INFO L225 Difference]: With dead ends: 49 [2023-04-02 02:05:22,462 INFO L226 Difference]: Without dead ends: 47 [2023-04-02 02:05:22,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-04-02 02:05:22,463 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 9 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-02 02:05:22,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 130 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 3 Unknown, 0 Unchecked, 0.6s Time] [2023-04-02 02:05:22,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-04-02 02:05:22,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2023-04-02 02:05:22,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2023-04-02 02:05:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2023-04-02 02:05:22,473 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 23 [2023-04-02 02:05:22,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 02:05:22,473 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2023-04-02 02:05:22,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-02 02:05:22,473 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2023-04-02 02:05:22,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-04-02 02:05:22,474 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 02:05:22,474 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 02:05:22,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-04-02 02:05:22,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:05:22,679 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 02:05:22,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 02:05:22,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1060153012, now seen corresponding path program 1 times [2023-04-02 02:05:22,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 02:05:22,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258962609] [2023-04-02 02:05:22,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:05:22,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 02:05:22,692 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 02:05:22,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [682575824] [2023-04-02 02:05:22,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:05:22,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:05:22,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 02:05:22,693 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-02 02:05:22,695 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-02 02:05:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 02:05:22,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjunts are in the unsatisfiable core [2023-04-02 02:05:22,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 02:05:22,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 02:05:22,879 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 02:05:22,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 02:05:22,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258962609] [2023-04-02 02:05:22,986 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 02:05:22,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682575824] [2023-04-02 02:05:22,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682575824] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 02:05:22,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-04-02 02:05:22,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-04-02 02:05:22,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145689945] [2023-04-02 02:05:22,987 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-04-02 02:05:22,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-02 02:05:22,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 02:05:22,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-02 02:05:22,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-04-02 02:05:22,989 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 02:05:23,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 02:05:23,202 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2023-04-02 02:05:23,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-02 02:05:23,202 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2023-04-02 02:05:23,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 02:05:23,204 INFO L225 Difference]: With dead ends: 53 [2023-04-02 02:05:23,204 INFO L226 Difference]: Without dead ends: 51 [2023-04-02 02:05:23,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-04-02 02:05:23,207 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 02:05:23,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 148 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 02:05:23,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-04-02 02:05:23,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2023-04-02 02:05:23,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2023-04-02 02:05:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2023-04-02 02:05:23,219 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 28 [2023-04-02 02:05:23,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 02:05:23,219 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2023-04-02 02:05:23,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 02:05:23,219 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2023-04-02 02:05:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-04-02 02:05:23,220 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 02:05:23,220 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-02 02:05:23,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-04-02 02:05:23,424 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,SelfDestructingSolverStorable3 [2023-04-02 02:05:23,425 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 02:05:23,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 02:05:23,425 INFO L85 PathProgramCache]: Analyzing trace with hash -560761015, now seen corresponding path program 1 times [2023-04-02 02:05:23,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 02:05:23,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150560886] [2023-04-02 02:05:23,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:05:23,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 02:05:23,432 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 02:05:23,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1829274757] [2023-04-02 02:05:23,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:05:23,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:05:23,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 02:05:23,441 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-02 02:05:23,442 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-02 02:05:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 02:05:23,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 22 conjunts are in the unsatisfiable core [2023-04-02 02:05:23,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 02:05:23,597 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 02:05:23,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 02:05:23,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 02:05:23,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150560886] [2023-04-02 02:05:23,666 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 02:05:23,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829274757] [2023-04-02 02:05:23,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829274757] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 02:05:23,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-04-02 02:05:23,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-04-02 02:05:23,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398206510] [2023-04-02 02:05:23,667 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-04-02 02:05:23,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 02:05:23,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 02:05:23,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 02:05:23,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-04-02 02:05:23,668 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-04-02 02:05:23,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 02:05:23,801 INFO L93 Difference]: Finished difference Result 75 states and 107 transitions. [2023-04-02 02:05:23,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 02:05:23,801 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2023-04-02 02:05:23,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 02:05:23,803 INFO L225 Difference]: With dead ends: 75 [2023-04-02 02:05:23,803 INFO L226 Difference]: Without dead ends: 71 [2023-04-02 02:05:23,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-04-02 02:05:23,804 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 02:05:23,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 108 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 02:05:23,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-04-02 02:05:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-04-02 02:05:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-04-02 02:05:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2023-04-02 02:05:23,817 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 33 [2023-04-02 02:05:23,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 02:05:23,817 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2023-04-02 02:05:23,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-04-02 02:05:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2023-04-02 02:05:23,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-02 02:05:23,818 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 02:05:23,818 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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] [2023-04-02 02:05:23,838 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-02 02:05:24,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:05:24,023 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 02:05:24,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 02:05:24,023 INFO L85 PathProgramCache]: Analyzing trace with hash 201438379, now seen corresponding path program 1 times [2023-04-02 02:05:24,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 02:05:24,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216502117] [2023-04-02 02:05:24,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:05:24,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 02:05:24,043 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 02:05:24,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [349387951] [2023-04-02 02:05:24,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:05:24,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:05:24,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 02:05:24,054 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-02 02:05:24,083 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-02 02:05:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 02:05:24,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-02 02:05:24,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 02:05:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-04-02 02:05:24,142 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 02:05:24,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 02:05:24,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216502117] [2023-04-02 02:05:24,143 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 02:05:24,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349387951] [2023-04-02 02:05:24,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349387951] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 02:05:24,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 02:05:24,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-02 02:05:24,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514763013] [2023-04-02 02:05:24,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 02:05:24,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 02:05:24,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 02:05:24,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 02:05:24,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-02 02:05:24,144 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-04-02 02:05:24,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 02:05:24,178 INFO L93 Difference]: Finished difference Result 87 states and 123 transitions. [2023-04-02 02:05:24,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 02:05:24,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2023-04-02 02:05:24,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 02:05:24,179 INFO L225 Difference]: With dead ends: 87 [2023-04-02 02:05:24,179 INFO L226 Difference]: Without dead ends: 85 [2023-04-02 02:05:24,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 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-02 02:05:24,180 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 5 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 02:05:24,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 141 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 02:05:24,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-04-02 02:05:24,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2023-04-02 02:05:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2023-04-02 02:05:24,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2023-04-02 02:05:24,194 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 39 [2023-04-02 02:05:24,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 02:05:24,195 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2023-04-02 02:05:24,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-04-02 02:05:24,195 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2023-04-02 02:05:24,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-04-02 02:05:24,196 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 02:05:24,196 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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] [2023-04-02 02:05:24,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-04-02 02:05:24,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:05:24,401 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 02:05:24,402 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 02:05:24,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1085077998, now seen corresponding path program 1 times [2023-04-02 02:05:24,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 02:05:24,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202442846] [2023-04-02 02:05:24,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:05:24,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 02:05:24,416 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 02:05:24,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1844681561] [2023-04-02 02:05:24,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:05:24,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:05:24,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 02:05:24,422 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-02 02:05:24,454 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-02 02:05:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 02:05:24,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2023-04-02 02:05:24,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 02:05:24,547 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-04-02 02:05:24,547 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 02:05:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-04-02 02:05:24,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 02:05:24,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202442846] [2023-04-02 02:05:24,602 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 02:05:24,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844681561] [2023-04-02 02:05:24,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844681561] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 02:05:24,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 02:05:24,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-04-02 02:05:24,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948362887] [2023-04-02 02:05:24,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 02:05:24,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 02:05:24,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 02:05:24,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 02:05:24,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-04-02 02:05:24,604 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2023-04-02 02:05:24,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 02:05:24,697 INFO L93 Difference]: Finished difference Result 222 states and 290 transitions. [2023-04-02 02:05:24,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 02:05:24,697 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 42 [2023-04-02 02:05:24,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 02:05:24,698 INFO L225 Difference]: With dead ends: 222 [2023-04-02 02:05:24,698 INFO L226 Difference]: Without dead ends: 200 [2023-04-02 02:05:24,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-04-02 02:05:24,699 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 58 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 02:05:24,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 168 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 02:05:24,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-04-02 02:05:24,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 194. [2023-04-02 02:05:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 120 states have internal predecessors, (133), 63 states have call successors, (63), 23 states have call predecessors, (63), 21 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2023-04-02 02:05:24,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 251 transitions. [2023-04-02 02:05:24,728 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 251 transitions. Word has length 42 [2023-04-02 02:05:24,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 02:05:24,728 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 251 transitions. [2023-04-02 02:05:24,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2023-04-02 02:05:24,728 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 251 transitions. [2023-04-02 02:05:24,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-04-02 02:05:24,729 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 02:05:24,729 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 02:05:24,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-04-02 02:05:24,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:05:24,934 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 02:05:24,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 02:05:24,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1083409702, now seen corresponding path program 1 times [2023-04-02 02:05:24,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 02:05:24,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634024075] [2023-04-02 02:05:24,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:05:24,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 02:05:24,941 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 02:05:24,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2132559750] [2023-04-02 02:05:24,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:05:24,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:05:24,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 02:05:24,944 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-02 02:05:24,945 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-02 02:05:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 02:05:24,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 19 conjunts are in the unsatisfiable core [2023-04-02 02:05:24,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 02:05:25,087 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-04-02 02:05:25,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 02:05:25,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 02:05:25,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634024075] [2023-04-02 02:05:25,323 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 02:05:25,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132559750] [2023-04-02 02:05:25,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132559750] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 02:05:25,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-04-02 02:05:25,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2023-04-02 02:05:25,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245540785] [2023-04-02 02:05:25,324 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-04-02 02:05:25,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 02:05:25,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 02:05:25,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 02:05:25,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=67, Unknown=1, NotChecked=0, Total=90 [2023-04-02 02:05:25,327 INFO L87 Difference]: Start difference. First operand 194 states and 251 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-04-02 02:05:25,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 02:05:25,415 INFO L93 Difference]: Finished difference Result 208 states and 264 transitions. [2023-04-02 02:05:25,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-02 02:05:25,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2023-04-02 02:05:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 02:05:25,419 INFO L225 Difference]: With dead ends: 208 [2023-04-02 02:05:25,419 INFO L226 Difference]: Without dead ends: 203 [2023-04-02 02:05:25,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=96, Unknown=1, NotChecked=0, Total=132 [2023-04-02 02:05:25,422 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 14 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 02:05:25,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 111 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 02:05:25,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-04-02 02:05:25,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2023-04-02 02:05:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 129 states have internal predecessors, (142), 60 states have call successors, (60), 26 states have call predecessors, (60), 24 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2023-04-02 02:05:25,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 254 transitions. [2023-04-02 02:05:25,455 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 254 transitions. Word has length 42 [2023-04-02 02:05:25,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 02:05:25,456 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 254 transitions. [2023-04-02 02:05:25,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-04-02 02:05:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 254 transitions. [2023-04-02 02:05:25,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-04-02 02:05:25,458 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 02:05:25,458 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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-02 02:05:25,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-04-02 02:05:25,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:05:25,663 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 02:05:25,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 02:05:25,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1376219446, now seen corresponding path program 1 times [2023-04-02 02:05:25,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 02:05:25,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047001260] [2023-04-02 02:05:25,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:05:25,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 02:05:25,673 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 02:05:25,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [457737233] [2023-04-02 02:05:25,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:05:25,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:05:25,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 02:05:25,674 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-02 02:05:25,677 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-02 02:05:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 02:05:25,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 18 conjunts are in the unsatisfiable core [2023-04-02 02:05:25,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 02:05:25,768 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-04-02 02:05:25,768 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 02:05:25,843 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-04-02 02:05:25,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 02:05:25,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047001260] [2023-04-02 02:05:25,843 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 02:05:25,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457737233] [2023-04-02 02:05:25,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457737233] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 02:05:25,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 02:05:25,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2023-04-02 02:05:25,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884467098] [2023-04-02 02:05:25,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 02:05:25,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-02 02:05:25,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 02:05:25,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-02 02:05:25,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-04-02 02:05:25,844 INFO L87 Difference]: Start difference. First operand 203 states and 254 transitions. Second operand has 12 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-04-02 02:05:25,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 02:05:25,957 INFO L93 Difference]: Finished difference Result 232 states and 290 transitions. [2023-04-02 02:05:25,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-02 02:05:25,957 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 44 [2023-04-02 02:05:25,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 02:05:25,959 INFO L225 Difference]: With dead ends: 232 [2023-04-02 02:05:25,959 INFO L226 Difference]: Without dead ends: 216 [2023-04-02 02:05:25,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-04-02 02:05:25,959 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 02:05:25,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 144 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 02:05:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-04-02 02:05:25,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2023-04-02 02:05:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 128 states have (on average 1.1640625) internal successors, (149), 139 states have internal predecessors, (149), 59 states have call successors, (59), 27 states have call predecessors, (59), 26 states have return successors, (54), 47 states have call predecessors, (54), 54 states have call successors, (54) [2023-04-02 02:05:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 262 transitions. [2023-04-02 02:05:25,981 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 262 transitions. Word has length 44 [2023-04-02 02:05:25,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 02:05:25,981 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 262 transitions. [2023-04-02 02:05:25,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-04-02 02:05:25,981 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 262 transitions. [2023-04-02 02:05:25,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-04-02 02:05:25,981 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 02:05:25,981 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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-02 02:05:26,003 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-02 02:05:26,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:05:26,187 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 02:05:26,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 02:05:26,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1137310021, now seen corresponding path program 2 times [2023-04-02 02:05:26,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 02:05:26,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088220452] [2023-04-02 02:05:26,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:05:26,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 02:05:26,192 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 02:05:26,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1607004806] [2023-04-02 02:05:26,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-02 02:05:26,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:05:26,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 02:05:26,193 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-02 02:05:26,235 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-02 02:05:26,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-02 02:05:26,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 02:05:26,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 34 conjunts are in the unsatisfiable core [2023-04-02 02:05:26,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 02:05:26,429 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-04-02 02:05:26,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 02:05:26,560 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-04-02 02:05:26,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 02:05:26,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088220452] [2023-04-02 02:05:26,561 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 02:05:26,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607004806] [2023-04-02 02:05:26,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607004806] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 02:05:26,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 02:05:26,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2023-04-02 02:05:26,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610851214] [2023-04-02 02:05:26,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 02:05:26,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-02 02:05:26,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 02:05:26,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-02 02:05:26,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-04-02 02:05:26,562 INFO L87 Difference]: Start difference. First operand 214 states and 262 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2023-04-02 02:05:27,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 02:05:27,572 INFO L93 Difference]: Finished difference Result 253 states and 314 transitions. [2023-04-02 02:05:27,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 02:05:27,572 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) Word has length 47 [2023-04-02 02:05:27,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 02:05:27,573 INFO L225 Difference]: With dead ends: 253 [2023-04-02 02:05:27,573 INFO L226 Difference]: Without dead ends: 229 [2023-04-02 02:05:27,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2023-04-02 02:05:27,575 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 45 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-04-02 02:05:27,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 179 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-04-02 02:05:27,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-04-02 02:05:27,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 210. [2023-04-02 02:05:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 134 states have (on average 1.126865671641791) internal successors, (151), 142 states have internal predecessors, (151), 47 states have call successors, (47), 29 states have call predecessors, (47), 28 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2023-04-02 02:05:27,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 240 transitions. [2023-04-02 02:05:27,602 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 240 transitions. Word has length 47 [2023-04-02 02:05:27,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 02:05:27,603 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 240 transitions. [2023-04-02 02:05:27,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2023-04-02 02:05:27,603 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 240 transitions. [2023-04-02 02:05:27,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-04-02 02:05:27,604 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 02:05:27,604 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 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] [2023-04-02 02:05:27,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-02 02:05:27,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-02 02:05:27,809 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 02:05:27,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 02:05:27,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1997533323, now seen corresponding path program 1 times [2023-04-02 02:05:27,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 02:05:27,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903653888] [2023-04-02 02:05:27,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:05:27,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 02:05:27,828 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 02:05:27,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1197981311] [2023-04-02 02:05:27,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:05:27,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:05:27,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 02:05:27,830 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 02:05:27,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-02 02:05:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 02:05:27,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 31 conjunts are in the unsatisfiable core [2023-04-02 02:05:27,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 02:05:28,065 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-04-02 02:05:28,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 02:05:28,213 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-04-02 02:05:28,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 02:05:28,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903653888] [2023-04-02 02:05:28,214 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 02:05:28,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197981311] [2023-04-02 02:05:28,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197981311] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 02:05:28,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 02:05:28,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-04-02 02:05:28,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299103222] [2023-04-02 02:05:28,214 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 02:05:28,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-02 02:05:28,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 02:05:28,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-02 02:05:28,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-04-02 02:05:28,215 INFO L87 Difference]: Start difference. First operand 210 states and 240 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 12 states have internal predecessors, (39), 8 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2023-04-02 02:05:28,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 02:05:28,604 INFO L93 Difference]: Finished difference Result 222 states and 256 transitions. [2023-04-02 02:05:28,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 02:05:28,606 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 12 states have internal predecessors, (39), 8 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 61 [2023-04-02 02:05:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 02:05:28,607 INFO L225 Difference]: With dead ends: 222 [2023-04-02 02:05:28,607 INFO L226 Difference]: Without dead ends: 195 [2023-04-02 02:05:28,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2023-04-02 02:05:28,608 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 33 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-02 02:05:28,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 315 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-02 02:05:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-04-02 02:05:28,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 189. [2023-04-02 02:05:28,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 125 states have (on average 1.112) internal successors, (139), 129 states have internal predecessors, (139), 38 states have call successors, (38), 26 states have call predecessors, (38), 25 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2023-04-02 02:05:28,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 212 transitions. [2023-04-02 02:05:28,628 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 212 transitions. Word has length 61 [2023-04-02 02:05:28,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 02:05:28,629 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 212 transitions. [2023-04-02 02:05:28,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 12 states have internal predecessors, (39), 8 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2023-04-02 02:05:28,629 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 212 transitions. [2023-04-02 02:05:28,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-04-02 02:05:28,630 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 02:05:28,630 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 02:05:28,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-02 02:05:28,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:05:28,837 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 02:05:28,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 02:05:28,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1449122399, now seen corresponding path program 2 times [2023-04-02 02:05:28,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 02:05:28,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446936603] [2023-04-02 02:05:28,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:05:28,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 02:05:28,847 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 02:05:28,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [70020456] [2023-04-02 02:05:28,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-02 02:05:28,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:05:28,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 02:05:28,853 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 02:05:28,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-02 02:05:28,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-02 02:05:28,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 02:05:28,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 13 conjunts are in the unsatisfiable core [2023-04-02 02:05:28,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 02:05:29,007 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-04-02 02:05:29,008 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 02:05:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2023-04-02 02:05:29,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 02:05:29,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446936603] [2023-04-02 02:05:29,113 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 02:05:29,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70020456] [2023-04-02 02:05:29,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70020456] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 02:05:29,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 02:05:29,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-04-02 02:05:29,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645615544] [2023-04-02 02:05:29,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 02:05:29,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-02 02:05:29,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 02:05:29,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-02 02:05:29,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-04-02 02:05:29,115 INFO L87 Difference]: Start difference. First operand 189 states and 212 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2023-04-02 02:05:29,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 02:05:29,300 INFO L93 Difference]: Finished difference Result 516 states and 605 transitions. [2023-04-02 02:05:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-02 02:05:29,301 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) Word has length 99 [2023-04-02 02:05:29,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 02:05:29,302 INFO L225 Difference]: With dead ends: 516 [2023-04-02 02:05:29,302 INFO L226 Difference]: Without dead ends: 507 [2023-04-02 02:05:29,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2023-04-02 02:05:29,303 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 87 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 02:05:29,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 136 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 02:05:29,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2023-04-02 02:05:29,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2023-04-02 02:05:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 335 states have (on average 1.0955223880597016) internal successors, (367), 345 states have internal predecessors, (367), 104 states have call successors, (104), 68 states have call predecessors, (104), 67 states have return successors, (101), 93 states have call predecessors, (101), 101 states have call successors, (101) [2023-04-02 02:05:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 572 transitions. [2023-04-02 02:05:29,351 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 572 transitions. Word has length 99 [2023-04-02 02:05:29,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 02:05:29,352 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 572 transitions. [2023-04-02 02:05:29,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2023-04-02 02:05:29,352 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 572 transitions. [2023-04-02 02:05:29,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-04-02 02:05:29,357 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 02:05:29,358 INFO L195 NwaCegarLoop]: trace histogram [31, 30, 30, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 02:05:29,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-02 02:05:29,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-04-02 02:05:29,562 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 02:05:29,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 02:05:29,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1980311871, now seen corresponding path program 3 times [2023-04-02 02:05:29,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 02:05:29,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052406398] [2023-04-02 02:05:29,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:05:29,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 02:05:29,573 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 02:05:29,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [893765351] [2023-04-02 02:05:29,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 02:05:29,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:05:29,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 02:05:29,574 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 02:05:29,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-02 02:05:29,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2023-04-02 02:05:29,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-04-02 02:05:29,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-02 02:05:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-02 02:05:29,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-04-02 02:05:29,839 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-02 02:05:29,839 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-02 02:05:29,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-04-02 02:05:30,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-04-02 02:05:30,049 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 02:05:30,052 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 02:05:30,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 02:05:30 BoogieIcfgContainer [2023-04-02 02:05:30,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 02:05:30,115 INFO L158 Benchmark]: Toolchain (without parser) took 9854.16ms. Allocated memory was 264.2MB in the beginning and 363.9MB in the end (delta: 99.6MB). Free memory was 228.0MB in the beginning and 318.0MB in the end (delta: -90.1MB). Peak memory consumption was 205.1MB. Max. memory is 8.0GB. [2023-04-02 02:05:30,115 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory was 138.8MB in the beginning and 138.7MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 02:05:30,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.28ms. Allocated memory is still 264.2MB. Free memory was 228.0MB in the beginning and 217.0MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-04-02 02:05:30,115 INFO L158 Benchmark]: Boogie Preprocessor took 20.26ms. Allocated memory is still 264.2MB. Free memory was 217.0MB in the beginning and 215.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-04-02 02:05:30,115 INFO L158 Benchmark]: RCFGBuilder took 223.03ms. Allocated memory is still 264.2MB. Free memory was 215.4MB in the beginning and 203.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-04-02 02:05:30,116 INFO L158 Benchmark]: TraceAbstraction took 9446.01ms. Allocated memory was 264.2MB in the beginning and 363.9MB in the end (delta: 99.6MB). Free memory was 202.8MB in the beginning and 318.0MB in the end (delta: -115.2MB). Peak memory consumption was 179.9MB. Max. memory is 8.0GB. [2023-04-02 02:05:30,116 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory was 138.8MB in the beginning and 138.7MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 161.28ms. Allocated memory is still 264.2MB. Free memory was 228.0MB in the beginning and 217.0MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.26ms. Allocated memory is still 264.2MB. Free memory was 217.0MB in the beginning and 215.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 223.03ms. Allocated memory is still 264.2MB. Free memory was 215.4MB in the beginning and 203.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 9446.01ms. Allocated memory was 264.2MB in the beginning and 363.9MB in the end (delta: 99.6MB). Free memory was 202.8MB in the beginning and 318.0MB in the end (delta: -115.2MB). Peak memory consumption was 179.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [\old(counter)=14, counter=0] [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [\old(counter)=0, counter=0, x=23, y=2] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [\old(counter)=0, counter=0, x=23, y=2] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [\old(counter)=0, a=23, b=2, counter=0, p=1, q=0, r=0, s=1, x=23, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=23, b=2, counter++=0, counter=1, p=1, q=0, r=0, s=1, x=23, y=2] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=23, b=2, counter=1, p=1, q=0, r=0, s=1, x=23, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=23, b=2, counter=1, p=1, q=0, r=0, s=1, x=23, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=23, b=2, counter=1, p=1, q=0, r=0, s=1, x=23, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=23, b=2, counter=1, p=1, q=0, r=0, s=1, x=23, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=21, b=2, counter=1, p=1, q=0, r=-1, s=1, x=23, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=21, b=2, counter++=1, counter=2, p=1, q=0, r=-1, s=1, x=23, y=2] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=21, b=2, counter=2, p=1, q=0, r=-1, s=1, x=23, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=21, b=2, counter=2, p=1, q=0, r=-1, s=1, x=23, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=21, b=2, counter=2, p=1, q=0, r=-1, s=1, x=23, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=21, b=2, counter=2, p=1, q=0, r=-1, s=1, x=23, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=19, b=2, counter=2, p=1, q=0, r=-2, s=1, x=23, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=19, b=2, counter++=2, counter=3, p=1, q=0, r=-2, s=1, x=23, y=2] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=19, b=2, counter=3, p=1, q=0, r=-2, s=1, x=23, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=19, b=2, counter=3, p=1, q=0, r=-2, s=1, x=23, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=19, b=2, counter=3, p=1, q=0, r=-2, s=1, x=23, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=19, b=2, counter=3, p=1, q=0, r=-2, s=1, x=23, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=17, b=2, counter=3, p=1, q=0, r=-3, s=1, x=23, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=17, b=2, counter++=3, counter=4, p=1, q=0, r=-3, s=1, x=23, y=2] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=17, b=2, counter=4, p=1, q=0, r=-3, s=1, x=23, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=17, b=2, counter=4, p=1, q=0, r=-3, s=1, x=23, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=17, b=2, counter=4, p=1, q=0, r=-3, s=1, x=23, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=17, b=2, counter=4, p=1, q=0, r=-3, s=1, x=23, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=15, b=2, counter=4, p=1, q=0, r=-4, s=1, x=23, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=15, b=2, counter++=4, counter=5, p=1, q=0, r=-4, s=1, x=23, y=2] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=15, b=2, counter=5, p=1, q=0, r=-4, s=1, x=23, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=15, b=2, counter=5, p=1, q=0, r=-4, s=1, x=23, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=15, b=2, counter=5, p=1, q=0, r=-4, s=1, x=23, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=15, b=2, counter=5, p=1, q=0, r=-4, s=1, x=23, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=13, b=2, counter=5, p=1, q=0, r=-5, s=1, x=23, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=13, b=2, counter++=5, counter=6, p=1, q=0, r=-5, s=1, x=23, y=2] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=13, b=2, counter=6, p=1, q=0, r=-5, s=1, x=23, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=13, b=2, counter=6, p=1, q=0, r=-5, s=1, x=23, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=13, b=2, counter=6, p=1, q=0, r=-5, s=1, x=23, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=13, b=2, counter=6, p=1, q=0, r=-5, s=1, x=23, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=11, b=2, counter=6, p=1, q=0, r=-6, s=1, x=23, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=11, b=2, counter++=6, counter=7, p=1, q=0, r=-6, s=1, x=23, y=2] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=11, b=2, counter=7, p=1, q=0, r=-6, s=1, x=23, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=11, b=2, counter=7, p=1, q=0, r=-6, s=1, x=23, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=11, b=2, counter=7, p=1, q=0, r=-6, s=1, x=23, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=11, b=2, counter=7, p=1, q=0, r=-6, s=1, x=23, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=9, b=2, counter=7, p=1, q=0, r=-7, s=1, x=23, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=9, b=2, counter++=7, counter=8, p=1, q=0, r=-7, s=1, x=23, y=2] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=9, b=2, counter=8, p=1, q=0, r=-7, s=1, x=23, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=9, b=2, counter=8, p=1, q=0, r=-7, s=1, x=23, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=9, b=2, counter=8, p=1, q=0, r=-7, s=1, x=23, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=9, b=2, counter=8, p=1, q=0, r=-7, s=1, x=23, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=7, b=2, counter=8, p=1, q=0, r=-8, s=1, x=23, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=7, b=2, counter++=8, counter=9, p=1, q=0, r=-8, s=1, x=23, y=2] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=7, b=2, counter=9, p=1, q=0, r=-8, s=1, x=23, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=7, b=2, counter=9, p=1, q=0, r=-8, s=1, x=23, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=7, b=2, counter=9, p=1, q=0, r=-8, s=1, x=23, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=7, b=2, counter=9, p=1, q=0, r=-8, s=1, x=23, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=5, b=2, counter=9, p=1, q=0, r=-9, s=1, x=23, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=5, b=2, counter++=9, counter=10, p=1, q=0, r=-9, s=1, x=23, y=2] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=5, b=2, counter=10, p=1, q=0, r=-9, s=1, x=23, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=5, b=2, counter=10, p=1, q=0, r=-9, s=1, x=23, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=5, b=2, counter=10, p=1, q=0, r=-9, s=1, x=23, y=2] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=5, b=2, counter=10, p=1, q=0, r=-9, s=1, x=23, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=3, b=2, counter=10, p=1, q=0, r=-10, s=1, x=23, y=2] [L34] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, counter++=10, counter=11, p=1, q=0, r=-10, s=1, x=23, y=2] [L34] COND FALSE !(counter++<10) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, \old(counter)=0, counter=11] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 13, TraceHistogramMax: 31, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 382 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 342 mSDsluCounter, 1666 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1275 mSDsCounter, 172 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1610 IncrementalHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 172 mSolverCounterUnsat, 391 mSDtfsCounter, 1610 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 845 GetRequests, 708 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=507occurred in iteration=12, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 43 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 716 NumberOfCodeBlocks, 716 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 801 ConstructedInterpolants, 3 QuantifiedInterpolants, 2585 SizeOfPredicates, 42 NumberOfNonLiveVariables, 1433 ConjunctsInSsa, 192 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 753/1143 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-04-02 02:05:30,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...