/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/mannadiv_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-15 00:01:01,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 00:01:01,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 00:01:01,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 00:01:01,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 00:01:01,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 00:01:01,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 00:01:01,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 00:01:01,809 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 00:01:01,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 00:01:01,811 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 00:01:01,812 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 00:01:01,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 00:01:01,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 00:01:01,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 00:01:01,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 00:01:01,815 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 00:01:01,816 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 00:01:01,818 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 00:01:01,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 00:01:01,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 00:01:01,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 00:01:01,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 00:01:01,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 00:01:01,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 00:01:01,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 00:01:01,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 00:01:01,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 00:01:01,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 00:01:01,841 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 00:01:01,841 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 00:01:01,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 00:01:01,842 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 00:01:01,843 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 00:01:01,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 00:01:01,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 00:01:01,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 00:01:01,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 00:01:01,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 00:01:01,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 00:01:01,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 00:01:01,857 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-15 00:01:01,871 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 00:01:01,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 00:01:01,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 00:01:01,872 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 00:01:01,872 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 00:01:01,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 00:01:01,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 00:01:01,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 00:01:01,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 00:01:01,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 00:01:01,873 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 00:01:01,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 00:01:01,873 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 00:01:01,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 00:01:01,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 00:01:01,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 00:01:01,874 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 00:01:01,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 00:01:01,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 00:01:01,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 00:01:01,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-15 00:01:01,875 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-15 00:01:01,875 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-02-15 00:01:02,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 00:01:02,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 00:01:02,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 00:01:02,091 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 00:01:02,094 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 00:01:02,095 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound50.c [2022-02-15 00:01:02,149 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/035e03d6f/7eded7f918724042a812af5a44829077/FLAGd3484c750 [2022-02-15 00:01:02,521 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 00:01:02,521 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound50.c [2022-02-15 00:01:02,526 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/035e03d6f/7eded7f918724042a812af5a44829077/FLAGd3484c750 [2022-02-15 00:01:02,535 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/035e03d6f/7eded7f918724042a812af5a44829077 [2022-02-15 00:01:02,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 00:01:02,538 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-15 00:01:02,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 00:01:02,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 00:01:02,551 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 00:01:02,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:01:02" (1/1) ... [2022-02-15 00:01:02,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@276965f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:01:02, skipping insertion in model container [2022-02-15 00:01:02,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:01:02" (1/1) ... [2022-02-15 00:01:02,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 00:01:02,570 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 00:01:02,743 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/mannadiv_unwindbound50.c[573,586] [2022-02-15 00:01:02,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 00:01:02,772 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 00:01:02,783 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/mannadiv_unwindbound50.c[573,586] [2022-02-15 00:01:02,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 00:01:02,822 INFO L208 MainTranslator]: Completed translation [2022-02-15 00:01:02,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:01:02 WrapperNode [2022-02-15 00:01:02,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 00:01:02,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 00:01:02,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 00:01:02,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 00:01:02,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:01:02" (1/1) ... [2022-02-15 00:01:02,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:01:02" (1/1) ... [2022-02-15 00:01:02,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:01:02" (1/1) ... [2022-02-15 00:01:02,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:01:02" (1/1) ... [2022-02-15 00:01:02,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:01:02" (1/1) ... [2022-02-15 00:01:02,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:01:02" (1/1) ... [2022-02-15 00:01:02,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:01:02" (1/1) ... [2022-02-15 00:01:02,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 00:01:02,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 00:01:02,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 00:01:02,873 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 00:01:02,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:01:02" (1/1) ... [2022-02-15 00:01:02,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 00:01:02,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:01:02,900 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-02-15 00:01:02,908 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-02-15 00:01:02,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 00:01:02,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 00:01:02,943 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 00:01:02,943 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-15 00:01:02,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-15 00:01:02,943 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 00:01:02,944 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 00:01:02,944 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 00:01:02,944 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 00:01:02,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 00:01:02,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-15 00:01:02,944 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-15 00:01:02,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-15 00:01:02,945 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 00:01:02,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 00:01:02,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 00:01:02,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 00:01:02,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 00:01:02,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 00:01:02,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 00:01:03,008 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 00:01:03,010 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 00:01:03,157 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 00:01:03,162 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 00:01:03,162 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-15 00:01:03,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:01:03 BoogieIcfgContainer [2022-02-15 00:01:03,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 00:01:03,164 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-15 00:01:03,164 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-15 00:01:03,173 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-15 00:01:03,192 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:01:03" (1/1) ... [2022-02-15 00:01:03,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.02 12:01:03 BasicIcfg [2022-02-15 00:01:03,205 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-15 00:01:03,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 00:01:03,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 00:01:03,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 00:01:03,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 12:01:02" (1/4) ... [2022-02-15 00:01:03,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ef797e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:01:03, skipping insertion in model container [2022-02-15 00:01:03,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:01:02" (2/4) ... [2022-02-15 00:01:03,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ef797e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:01:03, skipping insertion in model container [2022-02-15 00:01:03,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:01:03" (3/4) ... [2022-02-15 00:01:03,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ef797e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:01:03, skipping insertion in model container [2022-02-15 00:01:03,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.02 12:01:03" (4/4) ... [2022-02-15 00:01:03,224 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound50.cJordan [2022-02-15 00:01:03,228 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-15 00:01:03,228 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 00:01:03,262 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 00:01:03,268 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-02-15 00:01:03,268 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-15 00:01:03,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-15 00:01:03,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-15 00:01:03,284 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:01:03,285 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:01:03,285 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:01:03,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:01:03,290 INFO L85 PathProgramCache]: Analyzing trace with hash 734203501, now seen corresponding path program 1 times [2022-02-15 00:01:03,297 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:01:03,298 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569130760] [2022-02-15 00:01:03,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:01:03,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:01:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:01:03,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:01:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:01:03,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 00:01:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:01:03,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 00:01:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:01:03,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-15 00:01:03,462 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:01:03,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569130760] [2022-02-15 00:01:03,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569130760] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:01:03,463 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:01:03,463 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-15 00:01:03,464 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787504498] [2022-02-15 00:01:03,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:01:03,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-15 00:01:03,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:01:03,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-15 00:01:03,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-15 00:01:03,503 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-15 00:01:03,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:01:03,569 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-02-15 00:01:03,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-15 00:01:03,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-02-15 00:01:03,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:01:03,576 INFO L225 Difference]: With dead ends: 31 [2022-02-15 00:01:03,576 INFO L226 Difference]: Without dead ends: 26 [2022-02-15 00:01:03,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-15 00:01:03,580 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:01:03,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 00:01:03,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-15 00:01:03,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-02-15 00:01:03,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-15 00:01:03,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-02-15 00:01:03,610 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-02-15 00:01:03,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:01:03,611 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-02-15 00:01:03,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-15 00:01:03,611 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-02-15 00:01:03,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-15 00:01:03,612 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:01:03,612 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:01:03,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 00:01:03,613 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:01:03,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:01:03,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1669026344, now seen corresponding path program 1 times [2022-02-15 00:01:03,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:01:03,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819561576] [2022-02-15 00:01:03,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:01:03,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:01:03,632 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-15 00:01:03,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1086997238] [2022-02-15 00:01:03,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:01:03,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:01:03,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:01:03,635 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-02-15 00:01:03,646 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-02-15 00:01:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:01:03,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-15 00:01:03,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:01:03,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-15 00:01:03,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-15 00:01:03,862 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:01:03,862 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819561576] [2022-02-15 00:01:03,863 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-15 00:01:03,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086997238] [2022-02-15 00:01:03,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086997238] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:01:03,867 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:01:03,867 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:01:03,868 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985526002] [2022-02-15 00:01:03,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:01:03,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:01:03,870 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:01:03,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:01:03,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:01:03,872 INFO L87 Difference]: Start difference. First operand 25 states and 29 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-15 00:01:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:01:03,885 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-15 00:01:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:01:03,886 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-02-15 00:01:03,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:01:03,889 INFO L225 Difference]: With dead ends: 27 [2022-02-15 00:01:03,892 INFO L226 Difference]: Without dead ends: 27 [2022-02-15 00:01:03,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-02-15 00:01:03,896 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:01:03,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 00:01:03,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-15 00:01:03,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-15 00:01:03,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-15 00:01:03,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-02-15 00:01:03,900 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-02-15 00:01:03,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:01:03,901 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-02-15 00:01:03,901 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-15 00:01:03,901 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-15 00:01:03,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-15 00:01:03,902 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:01:03,902 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:01:03,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-15 00:01:04,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:01:04,116 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:01:04,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:01:04,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1667953868, now seen corresponding path program 1 times [2022-02-15 00:01:04,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:01:04,117 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916791702] [2022-02-15 00:01:04,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:01:04,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:01:04,130 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-15 00:01:04,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1685830821] [2022-02-15 00:01:04,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:01:04,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:01:04,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:01:04,132 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-02-15 00:01:04,135 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-02-15 00:01:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:01:04,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-15 00:01:04,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:01:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 00:01:04,365 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-15 00:01:04,365 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:01:04,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916791702] [2022-02-15 00:01:04,366 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-15 00:01:04,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685830821] [2022-02-15 00:01:04,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685830821] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:01:04,366 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:01:04,366 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 00:01:04,366 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662510304] [2022-02-15 00:01:04,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:01:04,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 00:01:04,367 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:01:04,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 00:01:04,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-15 00:01:04,368 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 00:01:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:01:04,474 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-02-15 00:01:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 00:01:04,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-02-15 00:01:04,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:01:04,476 INFO L225 Difference]: With dead ends: 35 [2022-02-15 00:01:04,476 INFO L226 Difference]: Without dead ends: 35 [2022-02-15 00:01:04,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-02-15 00:01:04,478 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:01:04,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 121 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 00:01:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-15 00:01:04,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-02-15 00:01:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-15 00:01:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-02-15 00:01:04,483 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-02-15 00:01:04,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:01:04,483 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-02-15 00:01:04,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 00:01:04,484 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-02-15 00:01:04,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-15 00:01:04,484 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:01:04,484 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:01:04,510 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-02-15 00:01:04,707 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,SelfDestructingSolverStorable2 [2022-02-15 00:01:04,708 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:01:04,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:01:04,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1179905874, now seen corresponding path program 1 times [2022-02-15 00:01:04,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:01:04,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567705843] [2022-02-15 00:01:04,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:01:04,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:01:04,725 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-15 00:01:04,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [754497606] [2022-02-15 00:01:04,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:01:04,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:01:04,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:01:04,729 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-02-15 00:01:04,730 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-02-15 00:01:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:01:04,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-15 00:01:04,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:01:04,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-15 00:01:04,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 00:01:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-15 00:01:05,105 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:01:05,106 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567705843] [2022-02-15 00:01:05,106 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-15 00:01:05,106 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754497606] [2022-02-15 00:01:05,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754497606] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 00:01:05,107 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-15 00:01:05,107 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-02-15 00:01:05,107 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752308652] [2022-02-15 00:01:05,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-15 00:01:05,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 00:01:05,108 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:01:05,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 00:01:05,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-15 00:01:05,110 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 00:01:05,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:01:05,215 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-02-15 00:01:05,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 00:01:05,216 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-02-15 00:01:05,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:01:05,218 INFO L225 Difference]: With dead ends: 37 [2022-02-15 00:01:05,218 INFO L226 Difference]: Without dead ends: 34 [2022-02-15 00:01:05,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-02-15 00:01:05,219 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:01:05,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 131 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 00:01:05,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-15 00:01:05,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-02-15 00:01:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-15 00:01:05,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-02-15 00:01:05,224 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-02-15 00:01:05,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:01:05,224 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-02-15 00:01:05,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 00:01:05,224 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-15 00:01:05,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-15 00:01:05,225 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:01:05,225 INFO L514 BasicCegarLoop]: trace histogram [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-02-15 00:01:05,251 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-02-15 00:01:05,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:01:05,448 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:01:05,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:01:05,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1668946595, now seen corresponding path program 1 times [2022-02-15 00:01:05,448 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:01:05,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550582752] [2022-02-15 00:01:05,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:01:05,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:01:05,459 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-15 00:01:05,460 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [525388579] [2022-02-15 00:01:05,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:01:05,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:01:05,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:01:05,465 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-02-15 00:01:05,478 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-02-15 00:01:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:01:05,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-15 00:01:05,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:01:05,589 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-15 00:01:05,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 00:01:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-15 00:01:05,661 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:01:05,661 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550582752] [2022-02-15 00:01:05,662 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-15 00:01:05,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525388579] [2022-02-15 00:01:05,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525388579] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 00:01:05,662 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-15 00:01:05,662 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-15 00:01:05,662 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930531897] [2022-02-15 00:01:05,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-15 00:01:05,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 00:01:05,663 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:01:05,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 00:01:05,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-15 00:01:05,664 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-15 00:01:05,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:01:05,722 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-02-15 00:01:05,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 00:01:05,723 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-02-15 00:01:05,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:01:05,724 INFO L225 Difference]: With dead ends: 56 [2022-02-15 00:01:05,724 INFO L226 Difference]: Without dead ends: 56 [2022-02-15 00:01:05,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-15 00:01:05,725 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:01:05,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 106 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 00:01:05,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-02-15 00:01:05,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-02-15 00:01:05,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-15 00:01:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-02-15 00:01:05,731 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2022-02-15 00:01:05,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:01:05,731 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-02-15 00:01:05,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-15 00:01:05,732 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-02-15 00:01:05,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-15 00:01:05,733 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:01:05,733 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:01:05,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-15 00:01:05,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:01:05,948 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:01:05,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:01:05,949 INFO L85 PathProgramCache]: Analyzing trace with hash -906969448, now seen corresponding path program 2 times [2022-02-15 00:01:05,949 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:01:05,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542570082] [2022-02-15 00:01:05,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:01:05,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:01:05,964 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-15 00:01:05,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [325815855] [2022-02-15 00:01:05,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-15 00:01:05,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:01:05,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:01:05,967 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-02-15 00:01:05,967 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-02-15 00:01:06,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-15 00:01:06,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 00:01:06,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-15 00:01:06,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:01:06,173 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-15 00:01:06,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 00:01:06,354 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-15 00:01:06,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:01:06,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542570082] [2022-02-15 00:01:06,355 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-15 00:01:06,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325815855] [2022-02-15 00:01:06,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325815855] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 00:01:06,355 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-15 00:01:06,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-02-15 00:01:06,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781883402] [2022-02-15 00:01:06,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-15 00:01:06,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-15 00:01:06,356 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:01:06,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-15 00:01:06,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-15 00:01:06,357 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-15 00:01:06,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:01:06,511 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-02-15 00:01:06,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-15 00:01:06,512 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2022-02-15 00:01:06,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:01:06,518 INFO L225 Difference]: With dead ends: 110 [2022-02-15 00:01:06,518 INFO L226 Difference]: Without dead ends: 110 [2022-02-15 00:01:06,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-02-15 00:01:06,521 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 107 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:01:06,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 176 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 00:01:06,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-02-15 00:01:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-02-15 00:01:06,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-15 00:01:06,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-02-15 00:01:06,541 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 59 [2022-02-15 00:01:06,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:01:06,542 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-02-15 00:01:06,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-15 00:01:06,542 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-02-15 00:01:06,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-02-15 00:01:06,549 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:01:06,549 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:01:06,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-15 00:01:06,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:01:06,750 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:01:06,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:01:06,750 INFO L85 PathProgramCache]: Analyzing trace with hash 191644600, now seen corresponding path program 3 times [2022-02-15 00:01:06,750 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:01:06,751 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285449262] [2022-02-15 00:01:06,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:01:06,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:01:06,776 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-15 00:01:06,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1471989946] [2022-02-15 00:01:06,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-15 00:01:06,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:01:06,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:01:06,781 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-02-15 00:01:06,783 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-02-15 00:01:06,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-15 00:01:06,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 00:01:06,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-15 00:01:06,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:01:07,147 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-15 00:01:07,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 00:01:07,552 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-02-15 00:01:07,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:01:07,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285449262] [2022-02-15 00:01:07,552 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-15 00:01:07,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471989946] [2022-02-15 00:01:07,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471989946] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 00:01:07,553 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-15 00:01:07,553 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-02-15 00:01:07,553 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575673296] [2022-02-15 00:01:07,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-15 00:01:07,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-15 00:01:07,554 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:01:07,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-15 00:01:07,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-02-15 00:01:07,555 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-02-15 00:01:07,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:01:07,989 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2022-02-15 00:01:07,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-02-15 00:01:07,990 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) Word has length 113 [2022-02-15 00:01:07,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:01:07,992 INFO L225 Difference]: With dead ends: 218 [2022-02-15 00:01:07,992 INFO L226 Difference]: Without dead ends: 218 [2022-02-15 00:01:07,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-02-15 00:01:07,993 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 279 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:01:07,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 290 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 00:01:07,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-02-15 00:01:08,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-02-15 00:01:08,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-15 00:01:08,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 241 transitions. [2022-02-15 00:01:08,006 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 241 transitions. Word has length 113 [2022-02-15 00:01:08,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:01:08,007 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 241 transitions. [2022-02-15 00:01:08,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-02-15 00:01:08,007 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions. [2022-02-15 00:01:08,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-02-15 00:01:08,010 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:01:08,010 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:01:08,035 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-02-15 00:01:08,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:01:08,228 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:01:08,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:01:08,229 INFO L85 PathProgramCache]: Analyzing trace with hash -698087944, now seen corresponding path program 4 times [2022-02-15 00:01:08,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:01:08,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831237319] [2022-02-15 00:01:08,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:01:08,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:01:08,244 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-15 00:01:08,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1829281458] [2022-02-15 00:01:08,245 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-15 00:01:08,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:01:08,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:01:08,246 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-02-15 00:01:08,262 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-02-15 00:01:08,359 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-15 00:01:08,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 00:01:08,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 49 conjunts are in the unsatisfiable core [2022-02-15 00:01:08,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:01:09,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 2123 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-15 00:01:09,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 00:01:10,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 1199 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2022-02-15 00:01:10,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:01:10,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831237319] [2022-02-15 00:01:10,017 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-15 00:01:10,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829281458] [2022-02-15 00:01:10,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829281458] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 00:01:10,017 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-15 00:01:10,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-02-15 00:01:10,018 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493198075] [2022-02-15 00:01:10,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-15 00:01:10,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-02-15 00:01:10,019 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:01:10,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-02-15 00:01:10,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-02-15 00:01:10,021 INFO L87 Difference]: Start difference. First operand 218 states and 241 transitions. Second operand has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-02-15 00:01:11,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:01:11,321 INFO L93 Difference]: Finished difference Result 434 states and 481 transitions. [2022-02-15 00:01:11,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-02-15 00:01:11,322 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) Word has length 221 [2022-02-15 00:01:11,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:01:11,326 INFO L225 Difference]: With dead ends: 434 [2022-02-15 00:01:11,327 INFO L226 Difference]: Without dead ends: 434 [2022-02-15 00:01:11,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-02-15 00:01:11,330 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 765 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:01:11,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 512 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 00:01:11,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-02-15 00:01:11,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2022-02-15 00:01:11,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 334 states have (on average 1.1407185628742516) internal successors, (381), 334 states have internal predecessors, (381), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-02-15 00:01:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 481 transitions. [2022-02-15 00:01:11,363 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 481 transitions. Word has length 221 [2022-02-15 00:01:11,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:01:11,364 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 481 transitions. [2022-02-15 00:01:11,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-02-15 00:01:11,365 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2022-02-15 00:01:11,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2022-02-15 00:01:11,379 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:01:11,379 INFO L514 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:01:11,407 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-02-15 00:01:11,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:01:11,594 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:01:11,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:01:11,595 INFO L85 PathProgramCache]: Analyzing trace with hash -619812232, now seen corresponding path program 5 times [2022-02-15 00:01:11,595 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:01:11,595 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083574179] [2022-02-15 00:01:11,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:01:11,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:01:11,630 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-15 00:01:11,631 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [672796490] [2022-02-15 00:01:11,631 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-15 00:01:11,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:01:11,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:01:11,637 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-02-15 00:01:11,639 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-02-15 00:01:12,042 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-02-15 00:01:12,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 00:01:12,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 1151 conjuncts, 97 conjunts are in the unsatisfiable core [2022-02-15 00:01:12,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:01:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 9407 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-15 00:01:13,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 00:01:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 5267 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2022-02-15 00:01:14,654 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:01:14,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083574179] [2022-02-15 00:01:14,655 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-15 00:01:14,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672796490] [2022-02-15 00:01:14,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672796490] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 00:01:14,655 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-15 00:01:14,655 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 54 [2022-02-15 00:01:14,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141502131] [2022-02-15 00:01:14,658 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-15 00:01:14,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-02-15 00:01:14,661 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:01:14,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-02-15 00:01:14,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-02-15 00:01:14,663 INFO L87 Difference]: Start difference. First operand 434 states and 481 transitions. Second operand has 54 states, 54 states have (on average 6.62962962962963) internal successors, (358), 54 states have internal predecessors, (358), 52 states have call successors, (100), 49 states have call predecessors, (100), 48 states have return successors, (98), 50 states have call predecessors, (98), 51 states have call successors, (98) [2022-02-15 00:01:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:01:16,068 INFO L93 Difference]: Finished difference Result 470 states and 521 transitions. [2022-02-15 00:01:16,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-02-15 00:01:16,069 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 6.62962962962963) internal successors, (358), 54 states have internal predecessors, (358), 52 states have call successors, (100), 49 states have call predecessors, (100), 48 states have return successors, (98), 50 states have call predecessors, (98), 51 states have call successors, (98) Word has length 437 [2022-02-15 00:01:16,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:01:16,072 INFO L225 Difference]: With dead ends: 470 [2022-02-15 00:01:16,072 INFO L226 Difference]: Without dead ends: 470 [2022-02-15 00:01:16,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 922 GetRequests, 820 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2022-02-15 00:01:16,076 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 515 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:01:16,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [515 Valid, 536 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 00:01:16,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-02-15 00:01:16,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2022-02-15 00:01:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 362 states have (on average 1.1408839779005524) internal successors, (413), 362 states have internal predecessors, (413), 55 states have call successors, (55), 54 states have call predecessors, (55), 52 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2022-02-15 00:01:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 521 transitions. [2022-02-15 00:01:16,090 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 521 transitions. Word has length 437 [2022-02-15 00:01:16,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:01:16,091 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 521 transitions. [2022-02-15 00:01:16,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 6.62962962962963) internal successors, (358), 54 states have internal predecessors, (358), 52 states have call successors, (100), 49 states have call predecessors, (100), 48 states have return successors, (98), 50 states have call predecessors, (98), 51 states have call successors, (98) [2022-02-15 00:01:16,092 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 521 transitions. [2022-02-15 00:01:16,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2022-02-15 00:01:16,101 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:01:16,101 INFO L514 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:01:16,135 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-02-15 00:01:16,315 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,SelfDestructingSolverStorable8 [2022-02-15 00:01:16,316 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:01:16,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:01:16,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1070552264, now seen corresponding path program 6 times [2022-02-15 00:01:16,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:01:16,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594232533] [2022-02-15 00:01:16,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:01:16,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:01:16,347 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-15 00:01:16,347 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1622132828] [2022-02-15 00:01:16,347 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-15 00:01:16,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:01:16,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:01:16,349 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-02-15 00:01:16,350 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-02-15 00:01:16,680 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2022-02-15 00:01:16,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-15 00:01:16,681 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-15 00:01:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-15 00:01:17,010 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-15 00:01:17,010 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-15 00:01:17,013 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-15 00:01:17,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-02-15 00:01:17,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-15 00:01:17,227 INFO L732 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2022-02-15 00:01:17,231 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 00:01:17,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:01:17 BasicIcfg [2022-02-15 00:01:17,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 00:01:17,373 INFO L158 Benchmark]: Toolchain (without parser) took 14834.44ms. Allocated memory was 184.5MB in the beginning and 311.4MB in the end (delta: 126.9MB). Free memory was 127.9MB in the beginning and 179.7MB in the end (delta: -51.8MB). Peak memory consumption was 76.6MB. Max. memory is 8.0GB. [2022-02-15 00:01:17,373 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 00:01:17,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.06ms. Allocated memory was 184.5MB in the beginning and 259.0MB in the end (delta: 74.4MB). Free memory was 127.8MB in the beginning and 232.4MB in the end (delta: -104.6MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. [2022-02-15 00:01:17,373 INFO L158 Benchmark]: Boogie Preprocessor took 39.45ms. Allocated memory is still 259.0MB. Free memory was 232.4MB in the beginning and 230.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-15 00:01:17,374 INFO L158 Benchmark]: RCFGBuilder took 291.30ms. Allocated memory is still 259.0MB. Free memory was 230.8MB in the beginning and 219.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-15 00:01:17,374 INFO L158 Benchmark]: IcfgTransformer took 40.86ms. Allocated memory is still 259.0MB. Free memory was 219.3MB in the beginning and 218.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-15 00:01:17,374 INFO L158 Benchmark]: TraceAbstraction took 14165.79ms. Allocated memory was 259.0MB in the beginning and 311.4MB in the end (delta: 52.4MB). Free memory was 217.7MB in the beginning and 179.7MB in the end (delta: 38.0MB). Peak memory consumption was 92.0MB. Max. memory is 8.0GB. [2022-02-15 00:01:17,376 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.12ms. Allocated memory is still 184.5MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 284.06ms. Allocated memory was 184.5MB in the beginning and 259.0MB in the end (delta: 74.4MB). Free memory was 127.8MB in the beginning and 232.4MB in the end (delta: -104.6MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.45ms. Allocated memory is still 259.0MB. Free memory was 232.4MB in the beginning and 230.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 291.30ms. Allocated memory is still 259.0MB. Free memory was 230.8MB in the beginning and 219.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 40.86ms. Allocated memory is still 259.0MB. Free memory was 219.3MB in the beginning and 218.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 14165.79ms. Allocated memory was 259.0MB in the beginning and 311.4MB in the end (delta: 52.4MB). Free memory was 217.7MB in the beginning and 179.7MB in the end (delta: 38.0MB). Peak memory consumption was 92.0MB. 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=52, counter=0] [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L29] RET assume_abort_if_not(x1 >= 0) VAL [\old(counter)=0, counter=0, x1=51, x2=1] [L30] CALL assume_abort_if_not(x2 != 0) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L30] RET assume_abort_if_not(x2 != 0) VAL [\old(counter)=0, counter=0, x1=51, x2=1] [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [\old(counter)=0, counter=0, x1=51, x2=1, y1=0, y2=0, y3=51] [L36] EXPR counter++ VAL [\old(counter)=0, counter=1, counter++=0, x1=51, x2=1, y1=0, y2=0, y3=51] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=1, x1=51, x2=1, y1=0, y2=0, y3=51] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=1, x1=51, x2=1, y1=0, y2=0, y3=51] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=1, x1=51, x2=1, y1=1, y2=0, y3=50] [L36] EXPR counter++ VAL [\old(counter)=0, counter=2, counter++=1, x1=51, x2=1, y1=1, y2=0, y3=50] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=2, x1=51, x2=1, y1=1, y2=0, y3=50] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=2, x1=51, x2=1, y1=1, y2=0, y3=50] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=2, x1=51, x2=1, y1=2, y2=0, y3=49] [L36] EXPR counter++ VAL [\old(counter)=0, counter=3, counter++=2, x1=51, x2=1, y1=2, y2=0, y3=49] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=3, x1=51, x2=1, y1=2, y2=0, y3=49] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=3, x1=51, x2=1, y1=2, y2=0, y3=49] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=3, x1=51, x2=1, y1=3, y2=0, y3=48] [L36] EXPR counter++ VAL [\old(counter)=0, counter=4, counter++=3, x1=51, x2=1, y1=3, y2=0, y3=48] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=4, x1=51, x2=1, y1=3, y2=0, y3=48] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=4, x1=51, x2=1, y1=3, y2=0, y3=48] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=4, x1=51, x2=1, y1=4, y2=0, y3=47] [L36] EXPR counter++ VAL [\old(counter)=0, counter=5, counter++=4, x1=51, x2=1, y1=4, y2=0, y3=47] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=5, x1=51, x2=1, y1=4, y2=0, y3=47] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=5, x1=51, x2=1, y1=4, y2=0, y3=47] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=5, x1=51, x2=1, y1=5, y2=0, y3=46] [L36] EXPR counter++ VAL [\old(counter)=0, counter=6, counter++=5, x1=51, x2=1, y1=5, y2=0, y3=46] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=6, x1=51, x2=1, y1=5, y2=0, y3=46] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=6, x1=51, x2=1, y1=5, y2=0, y3=46] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=6, x1=51, x2=1, y1=6, y2=0, y3=45] [L36] EXPR counter++ VAL [\old(counter)=0, counter=7, counter++=6, x1=51, x2=1, y1=6, y2=0, y3=45] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=7, x1=51, x2=1, y1=6, y2=0, y3=45] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=7, x1=51, x2=1, y1=6, y2=0, y3=45] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=7, x1=51, x2=1, y1=7, y2=0, y3=44] [L36] EXPR counter++ VAL [\old(counter)=0, counter=8, counter++=7, x1=51, x2=1, y1=7, y2=0, y3=44] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=8, x1=51, x2=1, y1=7, y2=0, y3=44] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=8, x1=51, x2=1, y1=7, y2=0, y3=44] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=8, x1=51, x2=1, y1=8, y2=0, y3=43] [L36] EXPR counter++ VAL [\old(counter)=0, counter=9, counter++=8, x1=51, x2=1, y1=8, y2=0, y3=43] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=9, x1=51, x2=1, y1=8, y2=0, y3=43] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=9, x1=51, x2=1, y1=8, y2=0, y3=43] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=9, x1=51, x2=1, y1=9, y2=0, y3=42] [L36] EXPR counter++ VAL [\old(counter)=0, counter=10, counter++=9, x1=51, x2=1, y1=9, y2=0, y3=42] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=10, x1=51, x2=1, y1=9, y2=0, y3=42] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=10, x1=51, x2=1, y1=9, y2=0, y3=42] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=10, x1=51, x2=1, y1=10, y2=0, y3=41] [L36] EXPR counter++ VAL [\old(counter)=0, counter=11, counter++=10, x1=51, x2=1, y1=10, y2=0, y3=41] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=11, x1=51, x2=1, y1=10, y2=0, y3=41] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=11, x1=51, x2=1, y1=10, y2=0, y3=41] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=11, x1=51, x2=1, y1=11, y2=0, y3=40] [L36] EXPR counter++ VAL [\old(counter)=0, counter=12, counter++=11, x1=51, x2=1, y1=11, y2=0, y3=40] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=12, x1=51, x2=1, y1=11, y2=0, y3=40] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=12, x1=51, x2=1, y1=11, y2=0, y3=40] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=12, x1=51, x2=1, y1=12, y2=0, y3=39] [L36] EXPR counter++ VAL [\old(counter)=0, counter=13, counter++=12, x1=51, x2=1, y1=12, y2=0, y3=39] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=13, x1=51, x2=1, y1=12, y2=0, y3=39] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=13, x1=51, x2=1, y1=12, y2=0, y3=39] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=13, x1=51, x2=1, y1=13, y2=0, y3=38] [L36] EXPR counter++ VAL [\old(counter)=0, counter=14, counter++=13, x1=51, x2=1, y1=13, y2=0, y3=38] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=14, x1=51, x2=1, y1=13, y2=0, y3=38] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=14, x1=51, x2=1, y1=13, y2=0, y3=38] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=14, x1=51, x2=1, y1=14, y2=0, y3=37] [L36] EXPR counter++ VAL [\old(counter)=0, counter=15, counter++=14, x1=51, x2=1, y1=14, y2=0, y3=37] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=15, x1=51, x2=1, y1=14, y2=0, y3=37] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=15, x1=51, x2=1, y1=14, y2=0, y3=37] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=15, x1=51, x2=1, y1=15, y2=0, y3=36] [L36] EXPR counter++ VAL [\old(counter)=0, counter=16, counter++=15, x1=51, x2=1, y1=15, y2=0, y3=36] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=16, x1=51, x2=1, y1=15, y2=0, y3=36] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=16, x1=51, x2=1, y1=15, y2=0, y3=36] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=16, x1=51, x2=1, y1=16, y2=0, y3=35] [L36] EXPR counter++ VAL [\old(counter)=0, counter=17, counter++=16, x1=51, x2=1, y1=16, y2=0, y3=35] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=17, x1=51, x2=1, y1=16, y2=0, y3=35] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=17, x1=51, x2=1, y1=16, y2=0, y3=35] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=17, x1=51, x2=1, y1=17, y2=0, y3=34] [L36] EXPR counter++ VAL [\old(counter)=0, counter=18, counter++=17, x1=51, x2=1, y1=17, y2=0, y3=34] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=18, x1=51, x2=1, y1=17, y2=0, y3=34] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=18, x1=51, x2=1, y1=17, y2=0, y3=34] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=18, x1=51, x2=1, y1=18, y2=0, y3=33] [L36] EXPR counter++ VAL [\old(counter)=0, counter=19, counter++=18, x1=51, x2=1, y1=18, y2=0, y3=33] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=19, x1=51, x2=1, y1=18, y2=0, y3=33] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=19, x1=51, x2=1, y1=18, y2=0, y3=33] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=19, x1=51, x2=1, y1=19, y2=0, y3=32] [L36] EXPR counter++ VAL [\old(counter)=0, counter=20, counter++=19, x1=51, x2=1, y1=19, y2=0, y3=32] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=20, x1=51, x2=1, y1=19, y2=0, y3=32] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=20, x1=51, x2=1, y1=19, y2=0, y3=32] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=20, x1=51, x2=1, y1=20, y2=0, y3=31] [L36] EXPR counter++ VAL [\old(counter)=0, counter=21, counter++=20, x1=51, x2=1, y1=20, y2=0, y3=31] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=21, x1=51, x2=1, y1=20, y2=0, y3=31] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=21, x1=51, x2=1, y1=20, y2=0, y3=31] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=21, x1=51, x2=1, y1=21, y2=0, y3=30] [L36] EXPR counter++ VAL [\old(counter)=0, counter=22, counter++=21, x1=51, x2=1, y1=21, y2=0, y3=30] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=22, x1=51, x2=1, y1=21, y2=0, y3=30] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=22, x1=51, x2=1, y1=21, y2=0, y3=30] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=22, x1=51, x2=1, y1=22, y2=0, y3=29] [L36] EXPR counter++ VAL [\old(counter)=0, counter=23, counter++=22, x1=51, x2=1, y1=22, y2=0, y3=29] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=23, x1=51, x2=1, y1=22, y2=0, y3=29] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=23, x1=51, x2=1, y1=22, y2=0, y3=29] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=23, x1=51, x2=1, y1=23, y2=0, y3=28] [L36] EXPR counter++ VAL [\old(counter)=0, counter=24, counter++=23, x1=51, x2=1, y1=23, y2=0, y3=28] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=24] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=24] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=24, x1=51, x2=1, y1=23, y2=0, y3=28] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=24, x1=51, x2=1, y1=23, y2=0, y3=28] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=24, x1=51, x2=1, y1=24, y2=0, y3=27] [L36] EXPR counter++ VAL [\old(counter)=0, counter=25, counter++=24, x1=51, x2=1, y1=24, y2=0, y3=27] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=25, x1=51, x2=1, y1=24, y2=0, y3=27] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=25, x1=51, x2=1, y1=24, y2=0, y3=27] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=25, x1=51, x2=1, y1=25, y2=0, y3=26] [L36] EXPR counter++ VAL [\old(counter)=0, counter=26, counter++=25, x1=51, x2=1, y1=25, y2=0, y3=26] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=26, x1=51, x2=1, y1=25, y2=0, y3=26] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=26, x1=51, x2=1, y1=25, y2=0, y3=26] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=26, x1=51, x2=1, y1=26, y2=0, y3=25] [L36] EXPR counter++ VAL [\old(counter)=0, counter=27, counter++=26, x1=51, x2=1, y1=26, y2=0, y3=25] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=27] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=27] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=27, x1=51, x2=1, y1=26, y2=0, y3=25] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=27, x1=51, x2=1, y1=26, y2=0, y3=25] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=27, x1=51, x2=1, y1=27, y2=0, y3=24] [L36] EXPR counter++ VAL [\old(counter)=0, counter=28, counter++=27, x1=51, x2=1, y1=27, y2=0, y3=24] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=28, x1=51, x2=1, y1=27, y2=0, y3=24] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=28, x1=51, x2=1, y1=27, y2=0, y3=24] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=28, x1=51, x2=1, y1=28, y2=0, y3=23] [L36] EXPR counter++ VAL [\old(counter)=0, counter=29, counter++=28, x1=51, x2=1, y1=28, y2=0, y3=23] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=29, x1=51, x2=1, y1=28, y2=0, y3=23] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=29, x1=51, x2=1, y1=28, y2=0, y3=23] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=29, x1=51, x2=1, y1=29, y2=0, y3=22] [L36] EXPR counter++ VAL [\old(counter)=0, counter=30, counter++=29, x1=51, x2=1, y1=29, y2=0, y3=22] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=30] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=30] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=30, x1=51, x2=1, y1=29, y2=0, y3=22] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=30, x1=51, x2=1, y1=29, y2=0, y3=22] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=30, x1=51, x2=1, y1=30, y2=0, y3=21] [L36] EXPR counter++ VAL [\old(counter)=0, counter=31, counter++=30, x1=51, x2=1, y1=30, y2=0, y3=21] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=31, x1=51, x2=1, y1=30, y2=0, y3=21] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=31, x1=51, x2=1, y1=30, y2=0, y3=21] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=31, x1=51, x2=1, y1=31, y2=0, y3=20] [L36] EXPR counter++ VAL [\old(counter)=0, counter=32, counter++=31, x1=51, x2=1, y1=31, y2=0, y3=20] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=32, x1=51, x2=1, y1=31, y2=0, y3=20] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=32, x1=51, x2=1, y1=31, y2=0, y3=20] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=32, x1=51, x2=1, y1=32, y2=0, y3=19] [L36] EXPR counter++ VAL [\old(counter)=0, counter=33, counter++=32, x1=51, x2=1, y1=32, y2=0, y3=19] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=33, x1=51, x2=1, y1=32, y2=0, y3=19] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=33, x1=51, x2=1, y1=32, y2=0, y3=19] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=33, x1=51, x2=1, y1=33, y2=0, y3=18] [L36] EXPR counter++ VAL [\old(counter)=0, counter=34, counter++=33, x1=51, x2=1, y1=33, y2=0, y3=18] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=34, x1=51, x2=1, y1=33, y2=0, y3=18] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=34, x1=51, x2=1, y1=33, y2=0, y3=18] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=34, x1=51, x2=1, y1=34, y2=0, y3=17] [L36] EXPR counter++ VAL [\old(counter)=0, counter=35, counter++=34, x1=51, x2=1, y1=34, y2=0, y3=17] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=35, x1=51, x2=1, y1=34, y2=0, y3=17] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=35, x1=51, x2=1, y1=34, y2=0, y3=17] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=35, x1=51, x2=1, y1=35, y2=0, y3=16] [L36] EXPR counter++ VAL [\old(counter)=0, counter=36, counter++=35, x1=51, x2=1, y1=35, y2=0, y3=16] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=36] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=36] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=36, x1=51, x2=1, y1=35, y2=0, y3=16] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=36, x1=51, x2=1, y1=35, y2=0, y3=16] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=36, x1=51, x2=1, y1=36, y2=0, y3=15] [L36] EXPR counter++ VAL [\old(counter)=0, counter=37, counter++=36, x1=51, x2=1, y1=36, y2=0, y3=15] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=37, x1=51, x2=1, y1=36, y2=0, y3=15] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=37, x1=51, x2=1, y1=36, y2=0, y3=15] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=37, x1=51, x2=1, y1=37, y2=0, y3=14] [L36] EXPR counter++ VAL [\old(counter)=0, counter=38, counter++=37, x1=51, x2=1, y1=37, y2=0, y3=14] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=38, x1=51, x2=1, y1=37, y2=0, y3=14] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=38, x1=51, x2=1, y1=37, y2=0, y3=14] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=38, x1=51, x2=1, y1=38, y2=0, y3=13] [L36] EXPR counter++ VAL [\old(counter)=0, counter=39, counter++=38, x1=51, x2=1, y1=38, y2=0, y3=13] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=39] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=39] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=39, x1=51, x2=1, y1=38, y2=0, y3=13] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=39, x1=51, x2=1, y1=38, y2=0, y3=13] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=39, x1=51, x2=1, y1=39, y2=0, y3=12] [L36] EXPR counter++ VAL [\old(counter)=0, counter=40, counter++=39, x1=51, x2=1, y1=39, y2=0, y3=12] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=40, x1=51, x2=1, y1=39, y2=0, y3=12] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=40, x1=51, x2=1, y1=39, y2=0, y3=12] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=40, x1=51, x2=1, y1=40, y2=0, y3=11] [L36] EXPR counter++ VAL [\old(counter)=0, counter=41, counter++=40, x1=51, x2=1, y1=40, y2=0, y3=11] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=41, x1=51, x2=1, y1=40, y2=0, y3=11] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=41, x1=51, x2=1, y1=40, y2=0, y3=11] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=41, x1=51, x2=1, y1=41, y2=0, y3=10] [L36] EXPR counter++ VAL [\old(counter)=0, counter=42, counter++=41, x1=51, x2=1, y1=41, y2=0, y3=10] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=42] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=42] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=42, x1=51, x2=1, y1=41, y2=0, y3=10] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=42, x1=51, x2=1, y1=41, y2=0, y3=10] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=42, x1=51, x2=1, y1=42, y2=0, y3=9] [L36] EXPR counter++ VAL [\old(counter)=0, counter=43, counter++=42, x1=51, x2=1, y1=42, y2=0, y3=9] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=43, x1=51, x2=1, y1=42, y2=0, y3=9] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=43, x1=51, x2=1, y1=42, y2=0, y3=9] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=43, x1=51, x2=1, y1=43, y2=0, y3=8] [L36] EXPR counter++ VAL [\old(counter)=0, counter=44, counter++=43, x1=51, x2=1, y1=43, y2=0, y3=8] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=44, x1=51, x2=1, y1=43, y2=0, y3=8] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=44, x1=51, x2=1, y1=43, y2=0, y3=8] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=44, x1=51, x2=1, y1=44, y2=0, y3=7] [L36] EXPR counter++ VAL [\old(counter)=0, counter=45, counter++=44, x1=51, x2=1, y1=44, y2=0, y3=7] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=45, x1=51, x2=1, y1=44, y2=0, y3=7] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=45, x1=51, x2=1, y1=44, y2=0, y3=7] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=45, x1=51, x2=1, y1=45, y2=0, y3=6] [L36] EXPR counter++ VAL [\old(counter)=0, counter=46, counter++=45, x1=51, x2=1, y1=45, y2=0, y3=6] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=46, x1=51, x2=1, y1=45, y2=0, y3=6] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=46, x1=51, x2=1, y1=45, y2=0, y3=6] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=46, x1=51, x2=1, y1=46, y2=0, y3=5] [L36] EXPR counter++ VAL [\old(counter)=0, counter=47, counter++=46, x1=51, x2=1, y1=46, y2=0, y3=5] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=47, x1=51, x2=1, y1=46, y2=0, y3=5] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=47, x1=51, x2=1, y1=46, y2=0, y3=5] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=47, x1=51, x2=1, y1=47, y2=0, y3=4] [L36] EXPR counter++ VAL [\old(counter)=0, counter=48, counter++=47, x1=51, x2=1, y1=47, y2=0, y3=4] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=48] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=48] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=48, x1=51, x2=1, y1=47, y2=0, y3=4] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=48, x1=51, x2=1, y1=47, y2=0, y3=4] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=48, x1=51, x2=1, y1=48, y2=0, y3=3] [L36] EXPR counter++ VAL [\old(counter)=0, counter=49, counter++=48, x1=51, x2=1, y1=48, y2=0, y3=3] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=49, x1=51, x2=1, y1=48, y2=0, y3=3] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=49, x1=51, x2=1, y1=48, y2=0, y3=3] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=49, x1=51, x2=1, y1=49, y2=0, y3=2] [L36] EXPR counter++ VAL [\old(counter)=0, counter=50, counter++=49, x1=51, x2=1, y1=49, y2=0, y3=2] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=50, x1=51, x2=1, y1=49, y2=0, y3=2] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=50, x1=51, x2=1, y1=49, y2=0, y3=2] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=50, x1=51, x2=1, y1=50, y2=0, y3=1] [L36] EXPR counter++ VAL [\old(counter)=0, counter=51, counter++=50, x1=51, x2=1, y1=50, y2=0, y3=1] [L36] COND FALSE !(counter++<50) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) VAL [\old(cond)=0, \old(counter)=0, counter=51] [L16] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] [L18] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 10, TraceHistogramMax: 51, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1745 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1741 mSDsluCounter, 1974 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1618 mSDsCounter, 536 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 992 IncrementalHoareTripleChecker+Invalid, 1528 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 536 mSolverCounterUnsat, 356 mSDtfsCounter, 992 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1962 GetRequests, 1669 SyntacticMatches, 2 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=470occurred in iteration=9, InterpolantAutomatonStates: 297, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 1432 NumberOfCodeBlocks, 1432 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 1835 ConstructedInterpolants, 0 QuantifiedInterpolants, 4575 SizeOfPredicates, 99 NumberOfNonLiveVariables, 2664 ConjunctsInSsa, 220 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 5662/24434 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-02-15 00:01:17,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...