/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 14:25:33,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 14:25:33,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 14:25:33,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 14:25:33,273 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 14:25:33,275 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 14:25:33,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 14:25:33,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 14:25:33,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 14:25:33,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 14:25:33,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 14:25:33,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 14:25:33,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 14:25:33,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 14:25:33,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 14:25:33,293 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 14:25:33,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 14:25:33,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 14:25:33,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 14:25:33,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 14:25:33,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 14:25:33,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 14:25:33,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 14:25:33,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 14:25:33,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 14:25:33,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 14:25:33,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 14:25:33,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 14:25:33,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 14:25:33,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 14:25:33,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 14:25:33,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 14:25:33,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 14:25:33,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 14:25:33,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 14:25:33,313 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 14:25:33,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 14:25:33,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 14:25:33,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 14:25:33,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 14:25:33,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 14:25:33,315 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 14:25:33,324 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 14:25:33,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 14:25:33,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 14:25:33,325 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 14:25:33,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 14:25:33,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 14:25:33,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 14:25:33,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 14:25:33,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 14:25:33,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 14:25:33,326 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 14:25:33,326 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 14:25:33,327 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 14:25:33,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 14:25:33,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 14:25:33,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 14:25:33,327 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 14:25:33,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 14:25:33,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 14:25:33,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 14:25:33,327 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 14:25:33,328 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 14:25:33,328 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 14:25:33,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 14:25:33,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 14:25:33,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 14:25:33,548 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 14:25:33,548 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 14:25:33,549 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound20.c [2022-01-31 14:25:33,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da62e7443/217eaaabca484cc8a2969d12b26c3699/FLAG2fc41301c [2022-01-31 14:25:33,914 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 14:25:33,915 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound20.c [2022-01-31 14:25:33,923 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da62e7443/217eaaabca484cc8a2969d12b26c3699/FLAG2fc41301c [2022-01-31 14:25:34,358 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da62e7443/217eaaabca484cc8a2969d12b26c3699 [2022-01-31 14:25:34,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 14:25:34,362 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 14:25:34,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 14:25:34,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 14:25:34,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 14:25:34,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 02:25:34" (1/1) ... [2022-01-31 14:25:34,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@616142c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:34, skipping insertion in model container [2022-01-31 14:25:34,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 02:25:34" (1/1) ... [2022-01-31 14:25:34,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 14:25:34,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 14:25:34,507 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound20.c[490,503] [2022-01-31 14:25:34,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 14:25:34,530 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 14:25:34,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound20.c[490,503] [2022-01-31 14:25:34,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 14:25:34,553 INFO L208 MainTranslator]: Completed translation [2022-01-31 14:25:34,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:34 WrapperNode [2022-01-31 14:25:34,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 14:25:34,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 14:25:34,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 14:25:34,554 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 14:25:34,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:34" (1/1) ... [2022-01-31 14:25:34,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:34" (1/1) ... [2022-01-31 14:25:34,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:34" (1/1) ... [2022-01-31 14:25:34,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:34" (1/1) ... [2022-01-31 14:25:34,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:34" (1/1) ... [2022-01-31 14:25:34,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:34" (1/1) ... [2022-01-31 14:25:34,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:34" (1/1) ... [2022-01-31 14:25:34,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 14:25:34,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 14:25:34,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 14:25:34,574 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 14:25:34,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:34" (1/1) ... [2022-01-31 14:25:34,579 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 14:25:34,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:25:34,595 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 14:25:34,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 14:25:34,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 14:25:34,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 14:25:34,629 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 14:25:34,629 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 14:25:34,629 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 14:25:34,629 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 14:25:34,629 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 14:25:34,629 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 14:25:34,629 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 14:25:34,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 14:25:34,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 14:25:34,629 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 14:25:34,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 14:25:34,630 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 14:25:34,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 14:25:34,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 14:25:34,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 14:25:34,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 14:25:34,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 14:25:34,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 14:25:34,710 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 14:25:34,712 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 14:25:34,901 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 14:25:34,905 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 14:25:34,906 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-31 14:25:34,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:25:34 BoogieIcfgContainer [2022-01-31 14:25:34,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 14:25:34,908 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 14:25:34,908 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 14:25:34,916 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 14:25:34,918 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:25:34" (1/1) ... [2022-01-31 14:25:34,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 02:25:34 BasicIcfg [2022-01-31 14:25:34,947 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 14:25:34,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 14:25:34,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 14:25:34,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 14:25:34,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 02:25:34" (1/4) ... [2022-01-31 14:25:34,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29083e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:25:34, skipping insertion in model container [2022-01-31 14:25:34,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:34" (2/4) ... [2022-01-31 14:25:34,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29083e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:25:34, skipping insertion in model container [2022-01-31 14:25:34,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:25:34" (3/4) ... [2022-01-31 14:25:34,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29083e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 02:25:34, skipping insertion in model container [2022-01-31 14:25:34,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 02:25:34" (4/4) ... [2022-01-31 14:25:34,954 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound20.cJordan [2022-01-31 14:25:34,959 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 14:25:34,959 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 14:25:34,997 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 14:25:35,008 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 14:25:35,008 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 14:25:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-01-31 14:25:35,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 14:25:35,027 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:25:35,027 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 14:25:35,028 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:25:35,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:25:35,031 INFO L85 PathProgramCache]: Analyzing trace with hash -282167495, now seen corresponding path program 1 times [2022-01-31 14:25:35,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:25:35,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974763294] [2022-01-31 14:25:35,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:35,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:25:35,127 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:25:35,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1562530511] [2022-01-31 14:25:35,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:35,129 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:35,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:25:35,130 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:25:35,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-31 14:25:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 14:25:35,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-31 14:25:35,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:25:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-31 14:25:35,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 14:25:35,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:25:35,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974763294] [2022-01-31 14:25:35,297 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:25:35,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562530511] [2022-01-31 14:25:35,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562530511] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 14:25:35,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 14:25:35,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-31 14:25:35,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311791685] [2022-01-31 14:25:35,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 14:25:35,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-31 14:25:35,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:25:35,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-31 14:25:35,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-31 14:25:35,328 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 14:25:35,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:25:35,343 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-01-31 14:25:35,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-31 14:25:35,345 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32 [2022-01-31 14:25:35,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:25:35,353 INFO L225 Difference]: With dead ends: 39 [2022-01-31 14:25:35,353 INFO L226 Difference]: Without dead ends: 34 [2022-01-31 14:25:35,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-31 14:25:35,357 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 14:25:35,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 14:25:35,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-31 14:25:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-01-31 14:25:35,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-31 14:25:35,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-01-31 14:25:35,389 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-01-31 14:25:35,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:25:35,391 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-01-31 14:25:35,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 14:25:35,391 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-01-31 14:25:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 14:25:35,392 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:25:35,393 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 14:25:35,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-31 14:25:35,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-01-31 14:25:35,608 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:25:35,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:25:35,608 INFO L85 PathProgramCache]: Analyzing trace with hash -127828113, now seen corresponding path program 1 times [2022-01-31 14:25:35,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:25:35,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636289410] [2022-01-31 14:25:35,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:35,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:25:35,625 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:25:35,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1518825167] [2022-01-31 14:25:35,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:35,626 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:35,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:25:35,630 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:25:35,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-31 14:25:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 14:25:35,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-31 14:25:35,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:25:35,773 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-31 14:25:35,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 14:25:35,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:25:35,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636289410] [2022-01-31 14:25:35,774 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:25:35,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518825167] [2022-01-31 14:25:35,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518825167] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 14:25:35,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 14:25:35,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 14:25:35,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548997670] [2022-01-31 14:25:35,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 14:25:35,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 14:25:35,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:25:35,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 14:25:35,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 14:25:35,777 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 14:25:35,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:25:35,788 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-01-31 14:25:35,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 14:25:35,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-01-31 14:25:35,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:25:35,789 INFO L225 Difference]: With dead ends: 36 [2022-01-31 14:25:35,789 INFO L226 Difference]: Without dead ends: 36 [2022-01-31 14:25:35,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 14:25:35,790 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 14:25:35,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 14:25:35,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-31 14:25:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-01-31 14:25:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-31 14:25:35,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-01-31 14:25:35,795 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-01-31 14:25:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:25:35,796 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-01-31 14:25:35,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 14:25:35,796 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-01-31 14:25:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 14:25:35,797 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:25:35,797 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 14:25:35,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-31 14:25:36,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-01-31 14:25:36,014 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:25:36,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:25:36,014 INFO L85 PathProgramCache]: Analyzing trace with hash 365419517, now seen corresponding path program 1 times [2022-01-31 14:25:36,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:25:36,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140265462] [2022-01-31 14:25:36,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:36,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:25:36,030 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:25:36,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [596139704] [2022-01-31 14:25:36,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:36,030 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:36,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:25:36,043 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:25:36,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-31 14:25:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 14:25:36,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 14:25:36,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:25:36,165 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 14:25:36,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:25:36,277 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 14:25:36,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:25:36,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140265462] [2022-01-31 14:25:36,278 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:25:36,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596139704] [2022-01-31 14:25:36,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596139704] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 14:25:36,278 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 14:25:36,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-01-31 14:25:36,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165695583] [2022-01-31 14:25:36,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 14:25:36,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 14:25:36,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:25:36,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 14:25:36,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 14:25:36,280 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 14:25:36,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:25:36,341 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-01-31 14:25:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 14:25:36,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-01-31 14:25:36,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:25:36,342 INFO L225 Difference]: With dead ends: 45 [2022-01-31 14:25:36,342 INFO L226 Difference]: Without dead ends: 45 [2022-01-31 14:25:36,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-31 14:25:36,343 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 30 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 14:25:36,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 127 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 14:25:36,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-31 14:25:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-01-31 14:25:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-31 14:25:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-01-31 14:25:36,348 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-01-31 14:25:36,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:25:36,348 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-01-31 14:25:36,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 14:25:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-01-31 14:25:36,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 14:25:36,349 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:25:36,349 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 14:25:36,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-31 14:25:36,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:36,565 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:25:36,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:25:36,566 INFO L85 PathProgramCache]: Analyzing trace with hash 196514290, now seen corresponding path program 1 times [2022-01-31 14:25:36,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:25:36,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970127996] [2022-01-31 14:25:36,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:36,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:25:36,574 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:25:36,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1763675281] [2022-01-31 14:25:36,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:36,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:36,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:25:36,581 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:25:36,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-31 14:25:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 14:25:36,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 14:25:36,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:25:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 14:25:36,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:25:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-31 14:25:36,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:25:36,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970127996] [2022-01-31 14:25:36,829 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:25:36,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763675281] [2022-01-31 14:25:36,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763675281] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-31 14:25:36,830 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 14:25:36,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-01-31 14:25:36,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260579162] [2022-01-31 14:25:36,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 14:25:36,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 14:25:36,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:25:36,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 14:25:36,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-31 14:25:36,831 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 14:25:36,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:25:36,866 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-01-31 14:25:36,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 14:25:36,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-01-31 14:25:36,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:25:36,867 INFO L225 Difference]: With dead ends: 41 [2022-01-31 14:25:36,867 INFO L226 Difference]: Without dead ends: 41 [2022-01-31 14:25:36,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-01-31 14:25:36,868 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 14:25:36,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 140 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 14:25:36,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-31 14:25:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-01-31 14:25:36,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-31 14:25:36,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-01-31 14:25:36,881 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 36 [2022-01-31 14:25:36,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:25:36,882 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-01-31 14:25:36,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 14:25:36,882 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-01-31 14:25:36,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 14:25:36,883 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:25:36,883 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 14:25:36,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-31 14:25:37,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:37,101 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:25:37,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:25:37,101 INFO L85 PathProgramCache]: Analyzing trace with hash 56558454, now seen corresponding path program 1 times [2022-01-31 14:25:37,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:25:37,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389591721] [2022-01-31 14:25:37,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:37,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:25:37,110 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:25:37,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1877439464] [2022-01-31 14:25:37,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:37,111 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:37,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:25:37,112 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:25:37,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-31 14:25:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 14:25:37,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 14:25:37,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:25:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-31 14:25:37,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 14:25:37,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:25:37,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389591721] [2022-01-31 14:25:37,230 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:25:37,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877439464] [2022-01-31 14:25:37,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877439464] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 14:25:37,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 14:25:37,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 14:25:37,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787364308] [2022-01-31 14:25:37,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 14:25:37,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 14:25:37,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:25:37,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 14:25:37,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 14:25:37,232 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 14:25:37,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:25:37,251 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-01-31 14:25:37,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 14:25:37,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-01-31 14:25:37,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:25:37,252 INFO L225 Difference]: With dead ends: 43 [2022-01-31 14:25:37,252 INFO L226 Difference]: Without dead ends: 43 [2022-01-31 14:25:37,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 14:25:37,253 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 14:25:37,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 14:25:37,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-31 14:25:37,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-01-31 14:25:37,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-31 14:25:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-01-31 14:25:37,256 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 39 [2022-01-31 14:25:37,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:25:37,257 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-01-31 14:25:37,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 14:25:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-01-31 14:25:37,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 14:25:37,257 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:25:37,258 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 14:25:37,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-31 14:25:37,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:37,458 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:25:37,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:25:37,459 INFO L85 PathProgramCache]: Analyzing trace with hash 578094295, now seen corresponding path program 1 times [2022-01-31 14:25:37,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:25:37,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898160038] [2022-01-31 14:25:37,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:37,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:25:37,468 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:25:37,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1045880731] [2022-01-31 14:25:37,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:37,468 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:37,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:25:37,472 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:25:37,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-31 14:25:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 14:25:37,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 14:25:37,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:25:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 14:25:37,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:25:37,737 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-31 14:25:37,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:25:37,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898160038] [2022-01-31 14:25:37,738 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:25:37,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045880731] [2022-01-31 14:25:37,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045880731] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-31 14:25:37,738 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 14:25:37,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-01-31 14:25:37,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018999693] [2022-01-31 14:25:37,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 14:25:37,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 14:25:37,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:25:37,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 14:25:37,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-31 14:25:37,740 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 14:25:37,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:25:37,764 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-01-31 14:25:37,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 14:25:37,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-01-31 14:25:37,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:25:37,766 INFO L225 Difference]: With dead ends: 55 [2022-01-31 14:25:37,766 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 14:25:37,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-31 14:25:37,767 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 14:25:37,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 169 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 14:25:37,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 14:25:37,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-01-31 14:25:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-31 14:25:37,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-01-31 14:25:37,772 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 41 [2022-01-31 14:25:37,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:25:37,773 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-01-31 14:25:37,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 14:25:37,773 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-01-31 14:25:37,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 14:25:37,773 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:25:37,774 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 14:25:37,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-31 14:25:37,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:37,987 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:25:37,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:25:37,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1581112078, now seen corresponding path program 1 times [2022-01-31 14:25:37,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:25:37,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915350224] [2022-01-31 14:25:37,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:37,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:25:37,997 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:25:37,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2117477450] [2022-01-31 14:25:37,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:37,997 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:37,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:25:37,999 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:25:38,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-31 14:25:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 14:25:38,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 14:25:38,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:25:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-31 14:25:38,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:25:38,280 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-01-31 14:25:38,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:25:38,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915350224] [2022-01-31 14:25:38,281 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:25:38,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117477450] [2022-01-31 14:25:38,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117477450] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-31 14:25:38,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 14:25:38,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-01-31 14:25:38,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961392252] [2022-01-31 14:25:38,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 14:25:38,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 14:25:38,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:25:38,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 14:25:38,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-31 14:25:38,282 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 14:25:38,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:25:38,312 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-01-31 14:25:38,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 14:25:38,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-01-31 14:25:38,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:25:38,313 INFO L225 Difference]: With dead ends: 59 [2022-01-31 14:25:38,313 INFO L226 Difference]: Without dead ends: 59 [2022-01-31 14:25:38,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-31 14:25:38,314 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 14:25:38,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 160 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 14:25:38,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-31 14:25:38,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-01-31 14:25:38,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-31 14:25:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-01-31 14:25:38,318 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 46 [2022-01-31 14:25:38,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:25:38,318 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2022-01-31 14:25:38,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 14:25:38,318 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-01-31 14:25:38,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 14:25:38,318 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:25:38,319 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 14:25:38,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-31 14:25:38,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:38,533 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:25:38,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:25:38,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1942645143, now seen corresponding path program 1 times [2022-01-31 14:25:38,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:25:38,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665604393] [2022-01-31 14:25:38,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:38,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:25:38,541 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:25:38,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2049060004] [2022-01-31 14:25:38,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:38,541 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:38,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:25:38,543 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:25:38,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-31 14:25:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 14:25:38,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-31 14:25:38,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:25:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-31 14:25:38,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:25:38,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:25:38,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665604393] [2022-01-31 14:25:38,872 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:25:38,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049060004] [2022-01-31 14:25:38,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049060004] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 14:25:38,872 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-31 14:25:38,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-01-31 14:25:38,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599268400] [2022-01-31 14:25:38,872 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-31 14:25:38,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 14:25:38,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:25:38,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 14:25:38,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-01-31 14:25:38,873 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 14:25:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:25:38,989 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-01-31 14:25:38,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 14:25:38,989 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-01-31 14:25:38,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:25:38,990 INFO L225 Difference]: With dead ends: 63 [2022-01-31 14:25:38,990 INFO L226 Difference]: Without dead ends: 63 [2022-01-31 14:25:38,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-01-31 14:25:38,991 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 14:25:38,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 190 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 14:25:38,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-31 14:25:38,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-01-31 14:25:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-31 14:25:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2022-01-31 14:25:38,994 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 51 [2022-01-31 14:25:38,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:25:38,995 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2022-01-31 14:25:38,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 14:25:38,995 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-01-31 14:25:38,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 14:25:38,995 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:25:38,995 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 14:25:39,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-31 14:25:39,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-01-31 14:25:39,196 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:25:39,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:25:39,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1573186588, now seen corresponding path program 1 times [2022-01-31 14:25:39,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:25:39,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022514451] [2022-01-31 14:25:39,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:39,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:25:39,204 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:25:39,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [698550420] [2022-01-31 14:25:39,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:39,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:39,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:25:39,206 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:25:39,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-31 14:25:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 14:25:39,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-31 14:25:39,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:25:39,335 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-01-31 14:25:39,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:25:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-01-31 14:25:39,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:25:39,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022514451] [2022-01-31 14:25:39,421 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:25:39,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698550420] [2022-01-31 14:25:39,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698550420] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 14:25:39,421 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 14:25:39,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-01-31 14:25:39,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237426689] [2022-01-31 14:25:39,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 14:25:39,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 14:25:39,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:25:39,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 14:25:39,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-31 14:25:39,423 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-01-31 14:25:39,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:25:39,537 INFO L93 Difference]: Finished difference Result 207 states and 242 transitions. [2022-01-31 14:25:39,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 14:25:39,537 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 60 [2022-01-31 14:25:39,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:25:39,540 INFO L225 Difference]: With dead ends: 207 [2022-01-31 14:25:39,541 INFO L226 Difference]: Without dead ends: 207 [2022-01-31 14:25:39,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-01-31 14:25:39,542 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 119 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 14:25:39,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 264 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 14:25:39,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-01-31 14:25:39,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 199. [2022-01-31 14:25:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-01-31 14:25:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 237 transitions. [2022-01-31 14:25:39,566 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 237 transitions. Word has length 60 [2022-01-31 14:25:39,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:25:39,566 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 237 transitions. [2022-01-31 14:25:39,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-01-31 14:25:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 237 transitions. [2022-01-31 14:25:39,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 14:25:39,567 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:25:39,567 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 14:25:39,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-31 14:25:39,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:39,786 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:25:39,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:25:39,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1491020248, now seen corresponding path program 1 times [2022-01-31 14:25:39,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:25:39,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951517491] [2022-01-31 14:25:39,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:39,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:25:39,817 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:25:39,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [73169519] [2022-01-31 14:25:39,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:39,818 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:39,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:25:39,819 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:25:39,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-31 14:25:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 14:25:39,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-31 14:25:39,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:25:39,953 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-31 14:25:39,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:25:40,064 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-31 14:25:40,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:25:40,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951517491] [2022-01-31 14:25:40,065 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:25:40,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73169519] [2022-01-31 14:25:40,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73169519] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 14:25:40,065 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 14:25:40,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-01-31 14:25:40,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458311059] [2022-01-31 14:25:40,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 14:25:40,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 14:25:40,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:25:40,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 14:25:40,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-31 14:25:40,067 INFO L87 Difference]: Start difference. First operand 199 states and 237 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-01-31 14:25:40,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:25:40,191 INFO L93 Difference]: Finished difference Result 263 states and 342 transitions. [2022-01-31 14:25:40,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 14:25:40,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2022-01-31 14:25:40,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:25:40,194 INFO L225 Difference]: With dead ends: 263 [2022-01-31 14:25:40,194 INFO L226 Difference]: Without dead ends: 263 [2022-01-31 14:25:40,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-01-31 14:25:40,195 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 62 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 14:25:40,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 387 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 14:25:40,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-01-31 14:25:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 239. [2022-01-31 14:25:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-01-31 14:25:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 303 transitions. [2022-01-31 14:25:40,215 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 303 transitions. Word has length 61 [2022-01-31 14:25:40,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:25:40,216 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 303 transitions. [2022-01-31 14:25:40,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-01-31 14:25:40,216 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 303 transitions. [2022-01-31 14:25:40,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 14:25:40,219 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:25:40,219 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 14:25:40,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-31 14:25:40,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-31 14:25:40,436 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:25:40,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:25:40,436 INFO L85 PathProgramCache]: Analyzing trace with hash 317217743, now seen corresponding path program 1 times [2022-01-31 14:25:40,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:25:40,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391150169] [2022-01-31 14:25:40,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:40,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:25:40,444 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:25:40,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1164439343] [2022-01-31 14:25:40,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:40,444 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:40,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:25:40,445 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:25:40,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-31 14:25:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 14:25:40,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-31 14:25:40,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:25:40,580 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-01-31 14:25:40,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:25:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-01-31 14:25:40,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:25:40,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391150169] [2022-01-31 14:25:40,681 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:25:40,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164439343] [2022-01-31 14:25:40,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164439343] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 14:25:40,681 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 14:25:40,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-01-31 14:25:40,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697903292] [2022-01-31 14:25:40,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 14:25:40,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 14:25:40,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:25:40,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 14:25:40,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-31 14:25:40,682 INFO L87 Difference]: Start difference. First operand 239 states and 303 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-01-31 14:25:40,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:25:40,785 INFO L93 Difference]: Finished difference Result 252 states and 308 transitions. [2022-01-31 14:25:40,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 14:25:40,786 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 63 [2022-01-31 14:25:40,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:25:40,787 INFO L225 Difference]: With dead ends: 252 [2022-01-31 14:25:40,787 INFO L226 Difference]: Without dead ends: 252 [2022-01-31 14:25:40,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-01-31 14:25:40,787 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 83 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 14:25:40,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 266 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 14:25:40,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-01-31 14:25:40,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 248. [2022-01-31 14:25:40,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-01-31 14:25:40,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 306 transitions. [2022-01-31 14:25:40,794 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 306 transitions. Word has length 63 [2022-01-31 14:25:40,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:25:40,794 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 306 transitions. [2022-01-31 14:25:40,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-01-31 14:25:40,795 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 306 transitions. [2022-01-31 14:25:40,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-31 14:25:40,795 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:25:40,795 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1] [2022-01-31 14:25:40,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-31 14:25:41,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-31 14:25:41,012 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:25:41,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:25:41,013 INFO L85 PathProgramCache]: Analyzing trace with hash 918639692, now seen corresponding path program 1 times [2022-01-31 14:25:41,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:25:41,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476937360] [2022-01-31 14:25:41,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:41,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:25:41,023 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:25:41,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [531291166] [2022-01-31 14:25:41,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:41,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:41,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:25:41,024 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:25:41,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-31 14:25:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 14:25:41,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-31 14:25:41,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:25:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-01-31 14:25:41,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:25:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-01-31 14:25:41,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:25:41,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476937360] [2022-01-31 14:25:41,453 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:25:41,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531291166] [2022-01-31 14:25:41,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531291166] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 14:25:41,453 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 14:25:41,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-01-31 14:25:41,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044663665] [2022-01-31 14:25:41,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 14:25:41,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 14:25:41,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:25:41,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 14:25:41,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-01-31 14:25:41,454 INFO L87 Difference]: Start difference. First operand 248 states and 306 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-01-31 14:25:41,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:25:41,720 INFO L93 Difference]: Finished difference Result 332 states and 429 transitions. [2022-01-31 14:25:41,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 14:25:41,721 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 68 [2022-01-31 14:25:41,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:25:41,723 INFO L225 Difference]: With dead ends: 332 [2022-01-31 14:25:41,723 INFO L226 Difference]: Without dead ends: 328 [2022-01-31 14:25:41,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-01-31 14:25:41,724 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 44 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 14:25:41,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 395 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 14:25:41,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-01-31 14:25:41,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 295. [2022-01-31 14:25:41,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2022-01-31 14:25:41,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 370 transitions. [2022-01-31 14:25:41,732 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 370 transitions. Word has length 68 [2022-01-31 14:25:41,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:25:41,733 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 370 transitions. [2022-01-31 14:25:41,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-01-31 14:25:41,733 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 370 transitions. [2022-01-31 14:25:41,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-31 14:25:41,733 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:25:41,733 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 14:25:41,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-31 14:25:41,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-31 14:25:41,950 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:25:41,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:25:41,950 INFO L85 PathProgramCache]: Analyzing trace with hash -210356579, now seen corresponding path program 2 times [2022-01-31 14:25:41,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:25:41,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724326208] [2022-01-31 14:25:41,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:41,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:25:41,958 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:25:41,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [435373120] [2022-01-31 14:25:41,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 14:25:41,958 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:41,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:25:41,959 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:25:41,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-31 14:25:42,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 14:25:42,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 14:25:42,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-31 14:25:42,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:25:42,267 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-01-31 14:25:42,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:25:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-01-31 14:25:42,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:25:42,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724326208] [2022-01-31 14:25:42,664 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:25:42,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435373120] [2022-01-31 14:25:42,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435373120] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 14:25:42,665 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 14:25:42,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-01-31 14:25:42,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583550539] [2022-01-31 14:25:42,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 14:25:42,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 14:25:42,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:25:42,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 14:25:42,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-01-31 14:25:42,667 INFO L87 Difference]: Start difference. First operand 295 states and 370 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-01-31 14:25:43,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:25:43,613 INFO L93 Difference]: Finished difference Result 317 states and 395 transitions. [2022-01-31 14:25:43,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 14:25:43,614 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) Word has length 73 [2022-01-31 14:25:43,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:25:43,615 INFO L225 Difference]: With dead ends: 317 [2022-01-31 14:25:43,615 INFO L226 Difference]: Without dead ends: 316 [2022-01-31 14:25:43,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-01-31 14:25:43,616 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 51 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 14:25:43,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 351 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 14:25:43,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-01-31 14:25:43,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 305. [2022-01-31 14:25:43,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2022-01-31 14:25:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 376 transitions. [2022-01-31 14:25:43,623 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 376 transitions. Word has length 73 [2022-01-31 14:25:43,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:25:43,623 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 376 transitions. [2022-01-31 14:25:43,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-01-31 14:25:43,623 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 376 transitions. [2022-01-31 14:25:43,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-01-31 14:25:43,624 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:25:43,624 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 14:25:43,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-31 14:25:43,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-31 14:25:43,840 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:25:43,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:25:43,841 INFO L85 PathProgramCache]: Analyzing trace with hash 952478412, now seen corresponding path program 3 times [2022-01-31 14:25:43,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:25:43,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973613580] [2022-01-31 14:25:43,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:43,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:25:43,847 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:25:43,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [653318386] [2022-01-31 14:25:43,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 14:25:43,847 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:43,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:25:43,848 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:25:43,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-31 14:25:43,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 14:25:43,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 14:25:43,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-31 14:25:43,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:25:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-01-31 14:25:44,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:25:44,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:25:44,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973613580] [2022-01-31 14:25:44,339 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:25:44,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653318386] [2022-01-31 14:25:44,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653318386] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 14:25:44,339 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-31 14:25:44,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-01-31 14:25:44,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098764327] [2022-01-31 14:25:44,339 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-31 14:25:44,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 14:25:44,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:25:44,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 14:25:44,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-01-31 14:25:44,340 INFO L87 Difference]: Start difference. First operand 305 states and 376 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-01-31 14:25:44,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:25:44,577 INFO L93 Difference]: Finished difference Result 335 states and 407 transitions. [2022-01-31 14:25:44,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 14:25:44,577 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 78 [2022-01-31 14:25:44,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:25:44,579 INFO L225 Difference]: With dead ends: 335 [2022-01-31 14:25:44,579 INFO L226 Difference]: Without dead ends: 333 [2022-01-31 14:25:44,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-01-31 14:25:44,579 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 24 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 14:25:44,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 249 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 14:25:44,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-01-31 14:25:44,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2022-01-31 14:25:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-01-31 14:25:44,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 402 transitions. [2022-01-31 14:25:44,587 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 402 transitions. Word has length 78 [2022-01-31 14:25:44,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:25:44,588 INFO L470 AbstractCegarLoop]: Abstraction has 330 states and 402 transitions. [2022-01-31 14:25:44,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-01-31 14:25:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 402 transitions. [2022-01-31 14:25:44,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-31 14:25:44,588 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:25:44,589 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 14:25:44,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-01-31 14:25:44,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:44,803 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:25:44,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:25:44,804 INFO L85 PathProgramCache]: Analyzing trace with hash 900405455, now seen corresponding path program 1 times [2022-01-31 14:25:44,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:25:44,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131760066] [2022-01-31 14:25:44,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:44,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:25:44,810 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:25:44,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [485158609] [2022-01-31 14:25:44,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:44,811 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:44,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:25:44,812 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:25:44,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-31 14:25:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 14:25:44,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 42 conjunts are in the unsatisfiable core [2022-01-31 14:25:44,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:25:45,345 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-01-31 14:25:45,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:25:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-01-31 14:25:45,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:25:45,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131760066] [2022-01-31 14:25:45,772 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:25:45,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485158609] [2022-01-31 14:25:45,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485158609] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 14:25:45,772 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 14:25:45,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-01-31 14:25:45,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721265744] [2022-01-31 14:25:45,772 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 14:25:45,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 14:25:45,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:25:45,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 14:25:45,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-01-31 14:25:45,773 INFO L87 Difference]: Start difference. First operand 330 states and 402 transitions. Second operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-01-31 14:25:48,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:25:48,198 INFO L93 Difference]: Finished difference Result 390 states and 484 transitions. [2022-01-31 14:25:48,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 14:25:48,198 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Word has length 84 [2022-01-31 14:25:48,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:25:48,200 INFO L225 Difference]: With dead ends: 390 [2022-01-31 14:25:48,200 INFO L226 Difference]: Without dead ends: 377 [2022-01-31 14:25:48,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2022-01-31 14:25:48,200 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 87 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-31 14:25:48,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 521 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-31 14:25:48,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-01-31 14:25:48,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 368. [2022-01-31 14:25:48,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-01-31 14:25:48,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 460 transitions. [2022-01-31 14:25:48,208 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 460 transitions. Word has length 84 [2022-01-31 14:25:48,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:25:48,208 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 460 transitions. [2022-01-31 14:25:48,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-01-31 14:25:48,209 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 460 transitions. [2022-01-31 14:25:48,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-31 14:25:48,209 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:25:48,209 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-31 14:25:48,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-31 14:25:48,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-31 14:25:48,423 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:25:48,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:25:48,424 INFO L85 PathProgramCache]: Analyzing trace with hash 653404933, now seen corresponding path program 1 times [2022-01-31 14:25:48,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:25:48,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192436327] [2022-01-31 14:25:48,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:48,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:25:48,430 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:25:48,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2138294780] [2022-01-31 14:25:48,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:48,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:48,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:25:48,434 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:25:48,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-31 14:25:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 14:25:48,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 41 conjunts are in the unsatisfiable core [2022-01-31 14:25:48,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:25:49,157 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 51 proven. 23 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-01-31 14:25:49,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:25:49,434 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 14:25:49,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:25:49,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192436327] [2022-01-31 14:25:49,943 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:25:49,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138294780] [2022-01-31 14:25:49,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138294780] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 14:25:49,943 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-31 14:25:49,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-01-31 14:25:49,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332977491] [2022-01-31 14:25:49,943 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-31 14:25:49,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 14:25:49,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:25:49,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 14:25:49,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-01-31 14:25:49,944 INFO L87 Difference]: Start difference. First operand 368 states and 460 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-01-31 14:25:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:25:50,356 INFO L93 Difference]: Finished difference Result 375 states and 465 transitions. [2022-01-31 14:25:50,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 14:25:50,357 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 101 [2022-01-31 14:25:50,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:25:50,358 INFO L225 Difference]: With dead ends: 375 [2022-01-31 14:25:50,358 INFO L226 Difference]: Without dead ends: 375 [2022-01-31 14:25:50,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-01-31 14:25:50,359 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 33 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 14:25:50,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 361 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 14:25:50,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-01-31 14:25:50,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2022-01-31 14:25:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-01-31 14:25:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 462 transitions. [2022-01-31 14:25:50,367 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 462 transitions. Word has length 101 [2022-01-31 14:25:50,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:25:50,367 INFO L470 AbstractCegarLoop]: Abstraction has 372 states and 462 transitions. [2022-01-31 14:25:50,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-01-31 14:25:50,367 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 462 transitions. [2022-01-31 14:25:50,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-31 14:25:50,368 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:25:50,368 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 14:25:50,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-31 14:25:50,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-31 14:25:50,584 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:25:50,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:25:50,584 INFO L85 PathProgramCache]: Analyzing trace with hash 487608439, now seen corresponding path program 4 times [2022-01-31 14:25:50,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:25:50,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507133144] [2022-01-31 14:25:50,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:50,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:25:50,594 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:25:50,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1170074649] [2022-01-31 14:25:50,594 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 14:25:50,595 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:50,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:25:50,596 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:25:50,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-31 14:25:50,641 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 14:25:50,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 14:25:50,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-31 14:25:50,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:25:50,768 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-01-31 14:25:50,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 14:25:50,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:25:50,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507133144] [2022-01-31 14:25:50,769 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:25:50,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170074649] [2022-01-31 14:25:50,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170074649] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 14:25:50,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 14:25:50,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 14:25:50,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94819727] [2022-01-31 14:25:50,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 14:25:50,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 14:25:50,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:25:50,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 14:25:50,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 14:25:50,770 INFO L87 Difference]: Start difference. First operand 372 states and 462 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-01-31 14:25:50,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:25:50,808 INFO L93 Difference]: Finished difference Result 417 states and 535 transitions. [2022-01-31 14:25:50,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 14:25:50,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 105 [2022-01-31 14:25:50,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:25:50,810 INFO L225 Difference]: With dead ends: 417 [2022-01-31 14:25:50,810 INFO L226 Difference]: Without dead ends: 417 [2022-01-31 14:25:50,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 14:25:50,810 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 12 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 14:25:50,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 194 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 14:25:50,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-01-31 14:25:50,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 387. [2022-01-31 14:25:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2022-01-31 14:25:50,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 487 transitions. [2022-01-31 14:25:50,819 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 487 transitions. Word has length 105 [2022-01-31 14:25:50,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:25:50,819 INFO L470 AbstractCegarLoop]: Abstraction has 387 states and 487 transitions. [2022-01-31 14:25:50,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-01-31 14:25:50,820 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 487 transitions. [2022-01-31 14:25:50,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-01-31 14:25:50,820 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:25:50,820 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 14:25:50,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-01-31 14:25:51,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-31 14:25:51,037 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:25:51,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:25:51,038 INFO L85 PathProgramCache]: Analyzing trace with hash 791718745, now seen corresponding path program 1 times [2022-01-31 14:25:51,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:25:51,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39508749] [2022-01-31 14:25:51,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:51,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:25:51,044 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:25:51,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1071366577] [2022-01-31 14:25:51,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:51,045 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:51,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:25:51,046 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:25:51,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-01-31 14:25:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 14:25:51,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-31 14:25:51,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:25:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 229 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-01-31 14:25:51,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:25:51,524 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 37 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-01-31 14:25:51,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:25:51,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39508749] [2022-01-31 14:25:51,525 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:25:51,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071366577] [2022-01-31 14:25:51,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071366577] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 14:25:51,525 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 14:25:51,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-01-31 14:25:51,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77833325] [2022-01-31 14:25:51,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 14:25:51,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 14:25:51,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:25:51,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 14:25:51,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-01-31 14:25:51,526 INFO L87 Difference]: Start difference. First operand 387 states and 487 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-01-31 14:25:51,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:25:51,846 INFO L93 Difference]: Finished difference Result 1260 states and 1555 transitions. [2022-01-31 14:25:51,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 14:25:51,846 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) Word has length 116 [2022-01-31 14:25:51,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:25:51,849 INFO L225 Difference]: With dead ends: 1260 [2022-01-31 14:25:51,850 INFO L226 Difference]: Without dead ends: 1260 [2022-01-31 14:25:51,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=311, Invalid=559, Unknown=0, NotChecked=0, Total=870 [2022-01-31 14:25:51,850 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 296 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 14:25:51,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 458 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 14:25:51,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-01-31 14:25:51,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1202. [2022-01-31 14:25:51,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) [2022-01-31 14:25:51,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1495 transitions. [2022-01-31 14:25:51,873 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1495 transitions. Word has length 116 [2022-01-31 14:25:51,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:25:51,874 INFO L470 AbstractCegarLoop]: Abstraction has 1202 states and 1495 transitions. [2022-01-31 14:25:51,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-01-31 14:25:51,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1495 transitions. [2022-01-31 14:25:51,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-31 14:25:51,875 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:25:51,875 INFO L514 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 14:25:51,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-01-31 14:25:52,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-31 14:25:52,096 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:25:52,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:25:52,096 INFO L85 PathProgramCache]: Analyzing trace with hash -351372628, now seen corresponding path program 2 times [2022-01-31 14:25:52,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:25:52,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372329118] [2022-01-31 14:25:52,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:25:52,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:25:52,113 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:25:52,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1498777515] [2022-01-31 14:25:52,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 14:25:52,114 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:25:52,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:25:52,118 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:25:52,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-01-31 14:25:52,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 14:25:52,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 14:25:52,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 73 conjunts are in the unsatisfiable core [2022-01-31 14:25:52,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:25:55,489 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 14:25:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 139 proven. 92 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2022-01-31 14:25:57,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:26:08,390 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 14:26:20,602 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-01-31 14:26:30,784 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 136 proven. 86 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2022-01-31 14:26:30,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:26:30,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372329118] [2022-01-31 14:26:30,784 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:26:30,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498777515] [2022-01-31 14:26:30,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498777515] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 14:26:30,784 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 14:26:30,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2022-01-31 14:26:30,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700917213] [2022-01-31 14:26:30,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 14:26:30,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-31 14:26:30,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:26:30,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-31 14:26:30,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=633, Unknown=9, NotChecked=0, Total=812 [2022-01-31 14:26:30,786 INFO L87 Difference]: Start difference. First operand 1202 states and 1495 transitions. Second operand has 29 states, 26 states have (on average 2.230769230769231) internal successors, (58), 20 states have internal predecessors, (58), 17 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (38), 15 states have call predecessors, (38), 16 states have call successors, (38) [2022-01-31 14:26:32,818 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:26:35,256 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:26:38,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:26:52,239 WARN L228 SmtUtils]: Spent 8.56s on a formula simplification. DAG size of input: 146 DAG size of output: 126 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 14:26:54,259 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:27:03,041 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:27:05,044 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:27:15,466 WARN L228 SmtUtils]: Spent 9.03s on a formula simplification. DAG size of input: 80 DAG size of output: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 14:27:22,488 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:27:29,000 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:27:31,002 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:27:33,523 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:27:43,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:27:45,063 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:27:47,074 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:27:50,800 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:27:52,806 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:27:54,811 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:27:59,668 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:28:05,165 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:28:07,370 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:28:09,375 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:28:20,408 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:28:22,416 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:28:30,547 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:28:33,515 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:28:35,519 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:28:43,241 WARN L228 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 147 DAG size of output: 127 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 14:28:46,566 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:28:49,329 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:28:51,502 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:28:53,572 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:29:03,491 WARN L228 SmtUtils]: Spent 7.58s on a formula simplification. DAG size of input: 147 DAG size of output: 127 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 14:29:10,776 WARN L228 SmtUtils]: Spent 6.53s on a formula simplification. DAG size of input: 87 DAG size of output: 86 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 14:29:20,963 WARN L228 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 110 DAG size of output: 90 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 14:29:22,968 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:29:24,979 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:29:26,982 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:29:35,883 WARN L228 SmtUtils]: Spent 5.84s on a formula simplification. DAG size of input: 146 DAG size of output: 127 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 14:29:42,579 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:29:44,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:29:46,634 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:29:48,640 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:29:50,648 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:29:52,651 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:29:54,677 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:29:56,686 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:29:58,694 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:30:00,697 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:30:02,711 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:30:04,713 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:30:06,718 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:30:06,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:30:06,720 INFO L93 Difference]: Finished difference Result 1624 states and 2101 transitions. [2022-01-31 14:30:06,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-31 14:30:06,721 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 2.230769230769231) internal successors, (58), 20 states have internal predecessors, (58), 17 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (38), 15 states have call predecessors, (38), 16 states have call successors, (38) Word has length 124 [2022-01-31 14:30:06,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:30:06,726 INFO L225 Difference]: With dead ends: 1624 [2022-01-31 14:30:06,726 INFO L226 Difference]: Without dead ends: 1624 [2022-01-31 14:30:06,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 218 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 143.0s TimeCoverageRelationStatistics Valid=610, Invalid=2029, Unknown=13, NotChecked=0, Total=2652 [2022-01-31 14:30:06,728 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 262 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 351 mSolverCounterUnsat, 40 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 103.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 40 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 103.3s IncrementalHoareTripleChecker+Time [2022-01-31 14:30:06,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 657 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 859 Invalid, 40 Unknown, 0 Unchecked, 103.3s Time] [2022-01-31 14:30:06,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2022-01-31 14:30:06,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1545. [2022-01-31 14:30:06,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 972 states have (on average 1.1779835390946503) internal successors, (1145), 988 states have internal predecessors, (1145), 430 states have call successors, (430), 143 states have call predecessors, (430), 142 states have return successors, (421), 413 states have call predecessors, (421), 421 states have call successors, (421) [2022-01-31 14:30:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1996 transitions. [2022-01-31 14:30:06,768 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1996 transitions. Word has length 124 [2022-01-31 14:30:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:30:06,768 INFO L470 AbstractCegarLoop]: Abstraction has 1545 states and 1996 transitions. [2022-01-31 14:30:06,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 2.230769230769231) internal successors, (58), 20 states have internal predecessors, (58), 17 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (38), 15 states have call predecessors, (38), 16 states have call successors, (38) [2022-01-31 14:30:06,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1996 transitions. [2022-01-31 14:30:06,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-01-31 14:30:06,771 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:30:06,771 INFO L514 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 14:30:06,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-01-31 14:30:06,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:30:06,987 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:30:06,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:30:06,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1703433466, now seen corresponding path program 3 times [2022-01-31 14:30:06,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:30:06,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073797296] [2022-01-31 14:30:06,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:30:06,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:30:07,000 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:30:07,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1321255482] [2022-01-31 14:30:07,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 14:30:07,001 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:30:07,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:30:07,008 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:30:07,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-01-31 14:30:07,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 14:30:07,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 14:30:07,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 67 conjunts are in the unsatisfiable core [2022-01-31 14:30:07,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:30:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 100 proven. 57 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-01-31 14:30:08,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:30:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 101 proven. 56 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-01-31 14:30:46,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:30:46,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073797296] [2022-01-31 14:30:46,718 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:30:46,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321255482] [2022-01-31 14:30:46,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321255482] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 14:30:46,718 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 14:30:46,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2022-01-31 14:30:46,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875406151] [2022-01-31 14:30:46,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 14:30:46,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 14:30:46,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:30:46,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 14:30:46,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=355, Unknown=2, NotChecked=0, Total=462 [2022-01-31 14:30:46,719 INFO L87 Difference]: Start difference. First operand 1545 states and 1996 transitions. Second operand has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) [2022-01-31 14:31:04,002 WARN L228 SmtUtils]: Spent 14.12s on a formula simplification that was a NOOP. DAG size: 136 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 14:31:08,390 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:31:10,440 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:31:12,597 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:31:14,857 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:31:24,108 WARN L228 SmtUtils]: Spent 8.96s on a formula simplification. DAG size of input: 82 DAG size of output: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 14:31:26,757 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:31:31,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:31:34,359 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:31:36,361 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:31:38,365 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:31:41,611 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:31:42,718 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:31:44,801 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:31:46,808 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:31:49,841 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:31:51,846 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:31:54,793 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:31:57,289 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:31:59,469 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:32:03,218 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:32:03,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:32:03,944 INFO L93 Difference]: Finished difference Result 1860 states and 2429 transitions. [2022-01-31 14:32:03,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 14:32:03,945 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) Word has length 128 [2022-01-31 14:32:03,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:32:03,950 INFO L225 Difference]: With dead ends: 1860 [2022-01-31 14:32:03,951 INFO L226 Difference]: Without dead ends: 1846 [2022-01-31 14:32:03,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 40.3s TimeCoverageRelationStatistics Valid=327, Invalid=931, Unknown=2, NotChecked=0, Total=1260 [2022-01-31 14:32:03,951 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 173 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 210 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.8s IncrementalHoareTripleChecker+Time [2022-01-31 14:32:03,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 672 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 818 Invalid, 17 Unknown, 0 Unchecked, 45.8s Time] [2022-01-31 14:32:03,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2022-01-31 14:32:03,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1756. [2022-01-31 14:32:03,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1118 states have (on average 1.1914132379248659) internal successors, (1332), 1130 states have internal predecessors, (1332), 482 states have call successors, (482), 157 states have call predecessors, (482), 155 states have return successors, (479), 468 states have call predecessors, (479), 479 states have call successors, (479) [2022-01-31 14:32:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2293 transitions. [2022-01-31 14:32:03,986 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2293 transitions. Word has length 128 [2022-01-31 14:32:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:32:03,986 INFO L470 AbstractCegarLoop]: Abstraction has 1756 states and 2293 transitions. [2022-01-31 14:32:03,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) [2022-01-31 14:32:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2293 transitions. [2022-01-31 14:32:03,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-01-31 14:32:03,987 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:32:03,987 INFO L514 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-31 14:32:04,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-01-31 14:32:04,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:32:04,203 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:32:04,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:32:04,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1569660177, now seen corresponding path program 1 times [2022-01-31 14:32:04,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:32:04,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61186101] [2022-01-31 14:32:04,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:32:04,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:32:04,210 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:32:04,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [185831706] [2022-01-31 14:32:04,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:32:04,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:32:04,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:32:04,211 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:32:04,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-01-31 14:32:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 14:32:04,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-31 14:32:04,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:32:04,491 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 32 proven. 434 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-01-31 14:32:04,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:32:04,742 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-01-31 14:32:04,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:32:04,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61186101] [2022-01-31 14:32:04,743 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:32:04,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185831706] [2022-01-31 14:32:04,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185831706] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 14:32:04,743 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 14:32:04,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-01-31 14:32:04,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449676133] [2022-01-31 14:32:04,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 14:32:04,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 14:32:04,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:32:04,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 14:32:04,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-01-31 14:32:04,744 INFO L87 Difference]: Start difference. First operand 1756 states and 2293 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (42), 10 states have call predecessors, (42), 11 states have call successors, (42) [2022-01-31 14:32:05,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:32:05,128 INFO L93 Difference]: Finished difference Result 1809 states and 2308 transitions. [2022-01-31 14:32:05,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 14:32:05,128 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (42), 10 states have call predecessors, (42), 11 states have call successors, (42) Word has length 133 [2022-01-31 14:32:05,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:32:05,134 INFO L225 Difference]: With dead ends: 1809 [2022-01-31 14:32:05,134 INFO L226 Difference]: Without dead ends: 1809 [2022-01-31 14:32:05,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=312, Invalid=558, Unknown=0, NotChecked=0, Total=870 [2022-01-31 14:32:05,135 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 276 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 14:32:05,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 349 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 14:32:05,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-31 14:32:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1777. [2022-01-31 14:32:05,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1139 states have (on average 1.160667251975417) internal successors, (1322), 1151 states have internal predecessors, (1322), 482 states have call successors, (482), 157 states have call predecessors, (482), 155 states have return successors, (479), 468 states have call predecessors, (479), 479 states have call successors, (479) [2022-01-31 14:32:05,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2283 transitions. [2022-01-31 14:32:05,166 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2283 transitions. Word has length 133 [2022-01-31 14:32:05,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:32:05,167 INFO L470 AbstractCegarLoop]: Abstraction has 1777 states and 2283 transitions. [2022-01-31 14:32:05,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (42), 10 states have call predecessors, (42), 11 states have call successors, (42) [2022-01-31 14:32:05,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2283 transitions. [2022-01-31 14:32:05,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-01-31 14:32:05,168 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:32:05,168 INFO L514 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-31 14:32:05,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-01-31 14:32:05,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:32:05,368 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:32:05,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:32:05,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1381701507, now seen corresponding path program 2 times [2022-01-31 14:32:05,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:32:05,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142732822] [2022-01-31 14:32:05,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:32:05,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:32:05,375 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:32:05,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [970865444] [2022-01-31 14:32:05,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 14:32:05,375 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:32:05,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:32:05,378 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:32:05,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-01-31 14:32:05,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 14:32:05,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 14:32:05,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 90 conjunts are in the unsatisfiable core [2022-01-31 14:32:05,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:32:07,427 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 123 proven. 126 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2022-01-31 14:32:07,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:32:08,583 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 156 proven. 12 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-01-31 14:32:08,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:32:08,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142732822] [2022-01-31 14:32:08,584 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:32:08,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970865444] [2022-01-31 14:32:08,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970865444] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 14:32:08,584 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 14:32:08,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 26 [2022-01-31 14:32:08,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985947491] [2022-01-31 14:32:08,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 14:32:08,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 14:32:08,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:32:08,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 14:32:08,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2022-01-31 14:32:08,585 INFO L87 Difference]: Start difference. First operand 1777 states and 2283 transitions. Second operand has 26 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 11 states have call predecessors, (31), 12 states have call successors, (31) [2022-01-31 14:32:14,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:32:14,079 INFO L93 Difference]: Finished difference Result 1897 states and 2418 transitions. [2022-01-31 14:32:14,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-31 14:32:14,080 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 11 states have call predecessors, (31), 12 states have call successors, (31) Word has length 134 [2022-01-31 14:32:14,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:32:14,086 INFO L225 Difference]: With dead ends: 1897 [2022-01-31 14:32:14,086 INFO L226 Difference]: Without dead ends: 1888 [2022-01-31 14:32:14,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 243 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=323, Invalid=1399, Unknown=0, NotChecked=0, Total=1722 [2022-01-31 14:32:14,087 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 114 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 14:32:14,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 635 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 14:32:14,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2022-01-31 14:32:14,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1729. [2022-01-31 14:32:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1729 states, 1098 states have (on average 1.138433515482696) internal successors, (1250), 1113 states have internal predecessors, (1250), 461 states have call successors, (461), 170 states have call predecessors, (461), 169 states have return successors, (459), 445 states have call predecessors, (459), 459 states have call successors, (459) [2022-01-31 14:32:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2170 transitions. [2022-01-31 14:32:14,119 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2170 transitions. Word has length 134 [2022-01-31 14:32:14,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:32:14,119 INFO L470 AbstractCegarLoop]: Abstraction has 1729 states and 2170 transitions. [2022-01-31 14:32:14,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 11 states have call predecessors, (31), 12 states have call successors, (31) [2022-01-31 14:32:14,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2170 transitions. [2022-01-31 14:32:14,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-01-31 14:32:14,123 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:32:14,124 INFO L514 BasicCegarLoop]: trace histogram [37, 36, 36, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 14:32:14,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-01-31 14:32:14,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:32:14,341 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:32:14,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:32:14,341 INFO L85 PathProgramCache]: Analyzing trace with hash -42185316, now seen corresponding path program 2 times [2022-01-31 14:32:14,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:32:14,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381710667] [2022-01-31 14:32:14,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:32:14,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:32:14,349 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:32:14,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [869916323] [2022-01-31 14:32:14,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 14:32:14,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:32:14,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:32:14,350 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:32:14,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-01-31 14:32:14,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 14:32:14,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 14:32:14,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-31 14:32:14,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:32:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2918 backedges. 72 proven. 2606 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-01-31 14:32:14,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:32:15,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2918 backedges. 72 proven. 302 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2022-01-31 14:32:15,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:32:15,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381710667] [2022-01-31 14:32:15,356 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:32:15,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869916323] [2022-01-31 14:32:15,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869916323] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 14:32:15,356 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 14:32:15,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2022-01-31 14:32:15,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279442722] [2022-01-31 14:32:15,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 14:32:15,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 14:32:15,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:32:15,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 14:32:15,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-01-31 14:32:15,358 INFO L87 Difference]: Start difference. First operand 1729 states and 2170 transitions. Second operand has 24 states, 24 states have (on average 5.666666666666667) internal successors, (136), 24 states have internal predecessors, (136), 18 states have call successors, (84), 12 states have call predecessors, (84), 11 states have return successors, (82), 16 states have call predecessors, (82), 17 states have call successors, (82) [2022-01-31 14:32:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:32:15,958 INFO L93 Difference]: Finished difference Result 3217 states and 4148 transitions. [2022-01-31 14:32:15,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-31 14:32:15,959 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.666666666666667) internal successors, (136), 24 states have internal predecessors, (136), 18 states have call successors, (84), 12 states have call predecessors, (84), 11 states have return successors, (82), 16 states have call predecessors, (82), 17 states have call successors, (82) Word has length 260 [2022-01-31 14:32:15,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:32:15,968 INFO L225 Difference]: With dead ends: 3217 [2022-01-31 14:32:15,969 INFO L226 Difference]: Without dead ends: 3215 [2022-01-31 14:32:15,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 496 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=629, Invalid=1093, Unknown=0, NotChecked=0, Total=1722 [2022-01-31 14:32:15,969 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 432 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 14:32:15,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [432 Valid, 533 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 14:32:15,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3215 states. [2022-01-31 14:32:16,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3215 to 3129. [2022-01-31 14:32:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3129 states, 2007 states have (on average 1.1778774289985052) internal successors, (2364), 2045 states have internal predecessors, (2364), 853 states have call successors, (853), 270 states have call predecessors, (853), 268 states have return successors, (847), 813 states have call predecessors, (847), 847 states have call successors, (847) [2022-01-31 14:32:16,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 4064 transitions. [2022-01-31 14:32:16,032 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 4064 transitions. Word has length 260 [2022-01-31 14:32:16,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:32:16,032 INFO L470 AbstractCegarLoop]: Abstraction has 3129 states and 4064 transitions. [2022-01-31 14:32:16,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.666666666666667) internal successors, (136), 24 states have internal predecessors, (136), 18 states have call successors, (84), 12 states have call predecessors, (84), 11 states have return successors, (82), 16 states have call predecessors, (82), 17 states have call successors, (82) [2022-01-31 14:32:16,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 4064 transitions. [2022-01-31 14:32:16,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-01-31 14:32:16,036 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:32:16,037 INFO L514 BasicCegarLoop]: trace histogram [37, 36, 36, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 14:32:16,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-01-31 14:32:16,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:32:16,251 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:32:16,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:32:16,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2118395671, now seen corresponding path program 1 times [2022-01-31 14:32:16,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:32:16,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275433391] [2022-01-31 14:32:16,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:32:16,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:32:16,263 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:32:16,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [425271848] [2022-01-31 14:32:16,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:32:16,264 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:32:16,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:32:16,276 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:32:16,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-01-31 14:32:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 14:32:16,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-31 14:32:16,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:32:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 91 proven. 2610 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-01-31 14:32:16,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:32:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 91 proven. 306 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2022-01-31 14:32:17,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:32:17,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275433391] [2022-01-31 14:32:17,236 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:32:17,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425271848] [2022-01-31 14:32:17,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425271848] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 14:32:17,236 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 14:32:17,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2022-01-31 14:32:17,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529623591] [2022-01-31 14:32:17,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 14:32:17,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 14:32:17,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:32:17,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 14:32:17,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-01-31 14:32:17,238 INFO L87 Difference]: Start difference. First operand 3129 states and 4064 transitions. Second operand has 24 states, 24 states have (on average 5.75) internal successors, (138), 24 states have internal predecessors, (138), 18 states have call successors, (84), 12 states have call predecessors, (84), 11 states have return successors, (82), 16 states have call predecessors, (82), 17 states have call successors, (82) [2022-01-31 14:32:17,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:32:17,808 INFO L93 Difference]: Finished difference Result 2791 states and 3478 transitions. [2022-01-31 14:32:17,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-31 14:32:17,809 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.75) internal successors, (138), 24 states have internal predecessors, (138), 18 states have call successors, (84), 12 states have call predecessors, (84), 11 states have return successors, (82), 16 states have call predecessors, (82), 17 states have call successors, (82) Word has length 263 [2022-01-31 14:32:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:32:17,817 INFO L225 Difference]: With dead ends: 2791 [2022-01-31 14:32:17,817 INFO L226 Difference]: Without dead ends: 2791 [2022-01-31 14:32:17,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 502 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=628, Invalid=1094, Unknown=0, NotChecked=0, Total=1722 [2022-01-31 14:32:17,819 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 395 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 14:32:17,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 548 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 14:32:17,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2022-01-31 14:32:17,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 2683. [2022-01-31 14:32:17,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2683 states, 1668 states have (on average 1.1235011990407673) internal successors, (1874), 1689 states have internal predecessors, (1874), 749 states have call successors, (749), 266 states have call predecessors, (749), 265 states have return successors, (747), 727 states have call predecessors, (747), 747 states have call successors, (747) [2022-01-31 14:32:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 3370 transitions. [2022-01-31 14:32:17,881 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 3370 transitions. Word has length 263 [2022-01-31 14:32:17,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:32:17,881 INFO L470 AbstractCegarLoop]: Abstraction has 2683 states and 3370 transitions. [2022-01-31 14:32:17,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.75) internal successors, (138), 24 states have internal predecessors, (138), 18 states have call successors, (84), 12 states have call predecessors, (84), 11 states have return successors, (82), 16 states have call predecessors, (82), 17 states have call successors, (82) [2022-01-31 14:32:17,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 3370 transitions. [2022-01-31 14:32:17,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2022-01-31 14:32:17,888 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:32:17,889 INFO L514 BasicCegarLoop]: trace histogram [53, 52, 52, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 8, 7, 7, 7, 7, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 14:32:17,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-01-31 14:32:18,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:32:18,106 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:32:18,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:32:18,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1140261512, now seen corresponding path program 3 times [2022-01-31 14:32:18,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:32:18,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222401069] [2022-01-31 14:32:18,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:32:18,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:32:18,115 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:32:18,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [590024830] [2022-01-31 14:32:18,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 14:32:18,115 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:32:18,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:32:18,116 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:32:18,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-01-31 14:33:48,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2022-01-31 14:33:48,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-01-31 14:33:48,141 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-31 14:33:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-31 14:33:50,530 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-31 14:33:50,531 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-31 14:33:50,531 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 14:33:50,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-01-31 14:33:50,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-01-31 14:33:50,735 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 14:33:50,737 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 14:33:50,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 02:33:50 BasicIcfg [2022-01-31 14:33:50,849 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 14:33:50,850 INFO L158 Benchmark]: Toolchain (without parser) took 496488.23ms. Allocated memory was 182.5MB in the beginning and 325.1MB in the end (delta: 142.6MB). Free memory was 128.7MB in the beginning and 173.1MB in the end (delta: -44.3MB). Peak memory consumption was 97.9MB. Max. memory is 8.0GB. [2022-01-31 14:33:50,850 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 14:33:50,850 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.57ms. Allocated memory was 182.5MB in the beginning and 270.5MB in the end (delta: 88.1MB). Free memory was 128.6MB in the beginning and 242.9MB in the end (delta: -114.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-31 14:33:50,850 INFO L158 Benchmark]: Boogie Preprocessor took 18.84ms. Allocated memory is still 270.5MB. Free memory was 242.9MB in the beginning and 241.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 14:33:50,850 INFO L158 Benchmark]: RCFGBuilder took 333.58ms. Allocated memory is still 270.5MB. Free memory was 241.8MB in the beginning and 228.7MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-31 14:33:50,850 INFO L158 Benchmark]: IcfgTransformer took 39.97ms. Allocated memory is still 270.5MB. Free memory was 228.7MB in the beginning and 227.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 14:33:50,850 INFO L158 Benchmark]: TraceAbstraction took 495900.66ms. Allocated memory was 270.5MB in the beginning and 325.1MB in the end (delta: 54.5MB). Free memory was 227.1MB in the beginning and 173.1MB in the end (delta: 54.1MB). Peak memory consumption was 109.1MB. Max. memory is 8.0GB. [2022-01-31 14:33:50,851 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.09ms. Allocated memory is still 182.5MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 189.57ms. Allocated memory was 182.5MB in the beginning and 270.5MB in the end (delta: 88.1MB). Free memory was 128.6MB in the beginning and 242.9MB in the end (delta: -114.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.84ms. Allocated memory is still 270.5MB. Free memory was 242.9MB in the beginning and 241.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 333.58ms. Allocated memory is still 270.5MB. Free memory was 241.8MB in the beginning and 228.7MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 39.97ms. Allocated memory is still 270.5MB. Free memory was 228.7MB in the beginning and 227.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 495900.66ms. Allocated memory was 270.5MB in the beginning and 325.1MB in the end (delta: 54.5MB). Free memory was 227.1MB in the beginning and 173.1MB in the end (delta: 54.1MB). Peak memory consumption was 109.1MB. 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)=24, counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s, c, k, xy, yy; [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=34, y=55] [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=34, y=55] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 [L33] c = 0 [L34] k = 0 [L35] xy = (long long) x * y [L36] yy = (long long) y * y VAL [\old(counter)=0, a=34, b=55, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=34, xy=1870, y=55, yy=3025] [L37] CALL assume_abort_if_not(xy < 2147483647) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L37] RET assume_abort_if_not(xy < 2147483647) VAL [\old(counter)=0, a=34, b=55, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=34, xy=1870, y=55, yy=3025] [L38] CALL assume_abort_if_not(yy < 2147483647) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L38] RET assume_abort_if_not(yy < 2147483647) VAL [\old(counter)=0, a=34, b=55, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=34, xy=1870, y=55, yy=3025] [L40] EXPR counter++ VAL [\old(counter)=0, a=34, b=55, c=0, counter=1, counter++=0, k=0, p=1, q=0, r=0, s=1, x=34, xy=1870, y=55, yy=3025] [L40] COND TRUE counter++<20 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=34, b=55, c=34, counter=1, k=0, p=1, q=0, r=0, s=1, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=34, b=55, c=34, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=34, b=55, c=34, counter=2, k=0, p=1, q=0, r=0, s=1, x=34, xy=1870, y=55, yy=3025] [L48] 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] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=34, b=55, c=34, counter=2, k=0, p=1, q=0, r=0, s=1, x=34, xy=1870, y=55, yy=3025] [L49] 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] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=34, b=55, c=34, counter=2, k=0, p=1, q=0, r=0, s=1, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=34, b=55, c=34, counter=2, k=0, p=1, q=0, r=0, s=1, x=34, xy=1870, y=55, yy=3025] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=34, b=55, c=34, counter=2, k=0, p=1, q=0, r=0, s=1, x=34, xy=1870, y=55, yy=3025] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=55, b=34, c=34, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L40] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=34, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L40] COND TRUE counter++<20 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=55, b=34, c=55, counter=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=55, counter=4, counter++=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=55, b=34, c=55, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L48] 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] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=55, b=34, c=55, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L49] 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] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=55, b=34, c=55, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=55, b=34, c=55, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=55, b=34, c=21, counter=4, k=1, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=21, counter=5, counter++=4, k=1, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=55, b=34, c=21, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L48] 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] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=55, b=34, c=21, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L49] 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] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=55, b=34, c=21, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=55, b=34, c=21, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=55, b=34, c=21, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=34, xy=1870, y=55, yy=3025] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=34, b=21, c=21, counter=5, k=1, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L40] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=21, counter=6, counter++=5, k=1, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L40] COND TRUE counter++<20 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=34, b=21, c=34, counter=6, k=0, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=34, counter=7, counter++=6, k=0, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=34, b=21, c=34, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L48] 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] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=34, b=21, c=34, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L49] 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] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=34, b=21, c=34, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=34, b=21, c=34, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=34, b=21, c=13, counter=7, k=1, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=13, counter=8, counter++=7, k=1, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=34, b=21, c=13, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L48] 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] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=34, b=21, c=13, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L49] 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] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=34, b=21, c=13, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=34, b=21, c=13, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=34, b=21, c=13, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=34, xy=1870, y=55, yy=3025] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=21, b=13, c=13, counter=8, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L40] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=13, counter=9, counter++=8, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L40] COND TRUE counter++<20 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=21, b=13, c=21, counter=9, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=21, counter=10, counter++=9, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=21, b=13, c=21, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L48] 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] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=21, b=13, c=21, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L49] 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] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=21, b=13, c=21, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=21, b=13, c=21, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=21, b=13, c=8, counter=10, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=8, counter=11, counter++=10, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=21, b=13, c=8, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=21, b=13, c=8, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=21, b=13, c=8, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=21, b=13, c=8, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=21, b=13, c=8, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=34, xy=1870, y=55, yy=3025] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=13, b=8, c=8, counter=11, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L40] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=8, counter=12, counter++=11, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L40] COND TRUE counter++<20 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=13, b=8, c=13, counter=12, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=13, counter=13, counter++=12, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=13, b=8, c=13, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=13, b=8, c=13, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=13, b=8, c=13, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=13, b=8, c=13, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=13, b=8, c=5, counter=13, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=5, counter=14, counter++=13, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=13, b=8, c=5, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=13, b=8, c=5, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=13, b=8, c=5, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=13, b=8, c=5, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=13, b=8, c=5, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=34, xy=1870, y=55, yy=3025] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=8, b=5, c=5, counter=14, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L40] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=5, counter=15, counter++=14, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L40] COND TRUE counter++<20 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=8, b=5, c=8, counter=15, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=8, counter=16, counter++=15, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=8, b=5, c=8, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=8, b=5, c=8, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=8, b=5, c=8, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=8, b=5, c=8, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=8, b=5, c=3, counter=16, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=3, counter=17, counter++=16, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=8, b=5, c=3, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=8, b=5, c=3, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=8, b=5, c=3, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=8, b=5, c=3, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=8, b=5, c=3, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=34, xy=1870, y=55, yy=3025] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=5, b=3, c=3, counter=17, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L40] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=3, counter=18, counter++=17, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L40] COND TRUE counter++<20 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=5, b=3, c=5, counter=18, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=5, counter=19, counter++=18, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=5, b=3, c=5, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=5, b=3, c=5, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=5, b=3, c=5, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=5, b=3, c=5, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=5, b=3, c=2, counter=19, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L46] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=2, counter=20, counter++=19, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L46] COND TRUE counter++<20 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=5, b=3, c=2, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=5, b=3, c=2, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=5, b=3, c=2, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=5, b=3, c=2, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=5, b=3, c=2, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=34, xy=1870, y=55, yy=3025] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=3, b=2, c=2, counter=20, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=34, xy=1870, y=55, yy=3025] [L40] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=2, counter=21, counter++=20, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=34, xy=1870, y=55, yy=3025] [L40] COND FALSE !(counter++<20) [L70] CALL __VERIFIER_assert(q*x + s*y == 0) VAL [\old(cond)=0, \old(counter)=0, counter=21] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 495.7s, OverallIterations: 25, TraceHistogramMax: 53, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 305.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 57 mSolverCounterUnknown, 2634 SdHoareTripleChecker+Valid, 156.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2554 mSDsluCounter, 7919 SdHoareTripleChecker+Invalid, 155.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6516 mSDsCounter, 2413 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5856 IncrementalHoareTripleChecker+Invalid, 8326 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2413 mSolverCounterUnsat, 1403 mSDtfsCounter, 5856 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4087 GetRequests, 3611 SyntacticMatches, 22 SemanticMatches, 454 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2333 ImplicationChecksByTransitivity, 191.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3129occurred in iteration=23, InterpolantAutomatonStates: 382, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 748 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 90.7s SatisfiabilityAnalysisTime, 90.0s InterpolantComputationTime, 2523 NumberOfCodeBlocks, 2443 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 3846 ConstructedInterpolants, 0 QuantifiedInterpolants, 24736 SizeOfPredicates, 152 NumberOfNonLiveVariables, 5979 ConjunctsInSsa, 643 ConjunctsInUnsatCore, 41 InterpolantComputations, 7 PerfectInterpolantSequences, 11750/18950 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-31 14:33:50,905 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...