/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/fermat2-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 14:37:41,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 14:37:41,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 14:37:41,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 14:37:41,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 14:37:41,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 14:37:41,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 14:37:41,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 14:37:41,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 14:37:41,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 14:37:41,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 14:37:41,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 14:37:41,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 14:37:41,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 14:37:41,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 14:37:41,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 14:37:41,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 14:37:41,733 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 14:37:41,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 14:37:41,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 14:37:41,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 14:37:41,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 14:37:41,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 14:37:41,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 14:37:41,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 14:37:41,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 14:37:41,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 14:37:41,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 14:37:41,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 14:37:41,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 14:37:41,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 14:37:41,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 14:37:41,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 14:37:41,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 14:37:41,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 14:37:41,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 14:37:41,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 14:37:41,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 14:37:41,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 14:37:41,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 14:37:41,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 14:37:41,752 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 14:37:41,759 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 14:37:41,759 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 14:37:41,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 14:37:41,761 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 14:37:41,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 14:37:41,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 14:37:41,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 14:37:41,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 14:37:41,761 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 14:37:41,761 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 14:37:41,761 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 14:37:41,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 14:37:41,762 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 14:37:41,762 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 14:37:41,762 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 14:37:41,762 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 14:37:41,762 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 14:37:41,762 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 14:37:41,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 14:37:41,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 14:37:41,763 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 14:37:41,763 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 14:37:41,763 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 14:37:41,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 14:37:41,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 14:37:41,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 14:37:41,962 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 14:37:41,962 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 14:37:41,963 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2022-01-31 14:37:42,024 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd8bc8f8/6940e0e70b6f48ceb5066d1612d8f830/FLAG94124a0da [2022-01-31 14:37:42,364 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 14:37:42,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2022-01-31 14:37:42,369 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd8bc8f8/6940e0e70b6f48ceb5066d1612d8f830/FLAG94124a0da [2022-01-31 14:37:42,381 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd8bc8f8/6940e0e70b6f48ceb5066d1612d8f830 [2022-01-31 14:37:42,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 14:37:42,383 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 14:37:42,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 14:37:42,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 14:37:42,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 14:37:42,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 02:37:42" (1/1) ... [2022-01-31 14:37:42,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@759fcf8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:37:42, skipping insertion in model container [2022-01-31 14:37:42,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 02:37:42" (1/1) ... [2022-01-31 14:37:42,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 14:37:42,407 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 14:37:42,520 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/fermat2-ll_unwindbound50.c[524,537] [2022-01-31 14:37:42,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 14:37:42,539 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 14:37:42,554 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/fermat2-ll_unwindbound50.c[524,537] [2022-01-31 14:37:42,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 14:37:42,603 INFO L208 MainTranslator]: Completed translation [2022-01-31 14:37:42,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:37:42 WrapperNode [2022-01-31 14:37:42,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 14:37:42,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 14:37:42,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 14:37:42,604 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 14:37:42,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:37:42" (1/1) ... [2022-01-31 14:37:42,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:37:42" (1/1) ... [2022-01-31 14:37:42,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:37:42" (1/1) ... [2022-01-31 14:37:42,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:37:42" (1/1) ... [2022-01-31 14:37:42,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:37:42" (1/1) ... [2022-01-31 14:37:42,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:37:42" (1/1) ... [2022-01-31 14:37:42,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:37:42" (1/1) ... [2022-01-31 14:37:42,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 14:37:42,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 14:37:42,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 14:37:42,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 14:37:42,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:37:42" (1/1) ... [2022-01-31 14:37:42,655 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 14:37:42,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:37:42,677 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 14:37:42,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 14:37:42,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 14:37:42,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 14:37:42,721 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 14:37:42,721 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 14:37:42,722 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 14:37:42,722 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 14:37:42,722 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 14:37:42,722 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 14:37:42,723 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 14:37:42,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 14:37:42,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 14:37:42,723 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 14:37:42,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 14:37:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 14:37:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 14:37:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 14:37:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 14:37:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 14:37:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 14:37:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 14:37:42,785 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 14:37:42,787 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 14:37:42,887 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 14:37:42,892 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 14:37:42,892 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 14:37:42,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:37:42 BoogieIcfgContainer [2022-01-31 14:37:42,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 14:37:42,894 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 14:37:42,895 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 14:37:42,896 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 14:37:42,898 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:37:42" (1/1) ... [2022-01-31 14:37:42,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 02:37:42 BasicIcfg [2022-01-31 14:37:42,915 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 14:37:42,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 14:37:42,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 14:37:42,919 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 14:37:42,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 02:37:42" (1/4) ... [2022-01-31 14:37:42,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28354454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:37:42, skipping insertion in model container [2022-01-31 14:37:42,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:37:42" (2/4) ... [2022-01-31 14:37:42,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28354454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:37:42, skipping insertion in model container [2022-01-31 14:37:42,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:37:42" (3/4) ... [2022-01-31 14:37:42,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28354454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 02:37:42, skipping insertion in model container [2022-01-31 14:37:42,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 02:37:42" (4/4) ... [2022-01-31 14:37:42,921 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound50.cJordan [2022-01-31 14:37:42,925 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 14:37:42,926 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 14:37:42,961 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 14:37:42,966 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 14:37:42,967 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 14:37:42,977 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-01-31 14:37:42,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 14:37:42,984 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:37:42,984 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-01-31 14:37:42,985 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:37:42,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:37:42,989 INFO L85 PathProgramCache]: Analyzing trace with hash 734203501, now seen corresponding path program 1 times [2022-01-31 14:37:42,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:37:42,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837380633] [2022-01-31 14:37:42,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:37:42,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:37:43,091 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:37:43,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2145028153] [2022-01-31 14:37:43,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:37:43,092 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:37:43,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:37:43,103 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:37:43,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-31 14:37:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 14:37:43,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-31 14:37:43,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:37:43,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 14:37:43,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 14:37:43,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:37:43,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837380633] [2022-01-31 14:37:43,306 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:37:43,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145028153] [2022-01-31 14:37:43,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145028153] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 14:37:43,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 14:37:43,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-31 14:37:43,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003641543] [2022-01-31 14:37:43,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 14:37:43,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-31 14:37:43,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:37:43,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-31 14:37:43,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-31 14:37:43,349 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 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 14:37:43,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:37:43,364 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-01-31 14:37:43,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-31 14:37:43,366 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 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-01-31 14:37:43,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:37:43,377 INFO L225 Difference]: With dead ends: 30 [2022-01-31 14:37:43,378 INFO L226 Difference]: Without dead ends: 25 [2022-01-31 14:37:43,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-31 14:37:43,384 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 14:37:43,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 14:37:43,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-31 14:37:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-31 14:37:43,419 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-01-31 14:37:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-01-31 14:37:43,420 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-01-31 14:37:43,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:37:43,421 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-01-31 14:37:43,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 14:37:43,421 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-01-31 14:37:43,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 14:37:43,422 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:37:43,423 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-01-31 14:37:43,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-31 14:37:43,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-01-31 14:37:43,624 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:37:43,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:37:43,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1669026344, now seen corresponding path program 1 times [2022-01-31 14:37:43,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:37:43,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043888825] [2022-01-31 14:37:43,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:37:43,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:37:43,641 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:37:43,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1010653592] [2022-01-31 14:37:43,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:37:43,642 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:37:43,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:37:43,643 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:37:43,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-31 14:37:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 14:37:43,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-31 14:37:43,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:37:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 14:37:43,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 14:37:43,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:37:43,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043888825] [2022-01-31 14:37:43,807 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:37:43,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010653592] [2022-01-31 14:37:43,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010653592] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 14:37:43,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 14:37:43,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 14:37:43,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460802744] [2022-01-31 14:37:43,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 14:37:43,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 14:37:43,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:37:43,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 14:37:43,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 14:37:43,810 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-01-31 14:37:43,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:37:43,821 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-01-31 14:37:43,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 14:37:43,821 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-01-31 14:37:43,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:37:43,822 INFO L225 Difference]: With dead ends: 27 [2022-01-31 14:37:43,822 INFO L226 Difference]: Without dead ends: 27 [2022-01-31 14:37:43,823 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-01-31 14:37:43,824 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-01-31 14:37:43,824 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-01-31 14:37:43,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-31 14:37:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-01-31 14:37:43,829 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-01-31 14:37:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-01-31 14:37:43,830 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-01-31 14:37:43,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:37:43,831 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-01-31 14:37:43,831 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-01-31 14:37:43,831 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-01-31 14:37:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 14:37:43,832 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:37:43,832 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-01-31 14:37:43,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-31 14:37:44,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-01-31 14:37:44,048 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:37:44,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:37:44,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1667953868, now seen corresponding path program 1 times [2022-01-31 14:37:44,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:37:44,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022759904] [2022-01-31 14:37:44,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:37:44,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:37:44,060 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:37:44,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [222413529] [2022-01-31 14:37:44,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:37:44,060 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:37:44,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:37:44,064 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:37:44,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-31 14:37:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 14:37:44,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 14:37:44,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:37:44,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 14:37:44,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 14:37:44,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:37:44,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022759904] [2022-01-31 14:37:44,508 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:37:44,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222413529] [2022-01-31 14:37:44,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222413529] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 14:37:44,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 14:37:44,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 14:37:44,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326035428] [2022-01-31 14:37:44,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 14:37:44,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 14:37:44,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:37:44,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 14:37:44,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 14:37:44,511 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 14:37:46,553 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-01-31 14:37:46,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:37:46,571 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-01-31 14:37:46,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 14:37:46,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-01-31 14:37:46,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:37:46,573 INFO L225 Difference]: With dead ends: 35 [2022-01-31 14:37:46,573 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 14:37:46,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-31 14:37:46,575 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-31 14:37:46,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 88 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-01-31 14:37:46,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 14:37:46,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-01-31 14:37:46,585 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-01-31 14:37:46,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-01-31 14:37:46,586 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-01-31 14:37:46,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:37:46,586 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-01-31 14:37:46,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 14:37:46,587 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-01-31 14:37:46,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 14:37:46,588 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:37:46,588 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-01-31 14:37:46,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-31 14:37:46,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:37:46,789 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:37:46,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:37:46,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1179905874, now seen corresponding path program 1 times [2022-01-31 14:37:46,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:37:46,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625150097] [2022-01-31 14:37:46,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:37:46,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:37:46,799 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:37:46,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1186611475] [2022-01-31 14:37:46,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:37:46,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:37:46,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:37:46,801 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:37:46,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-31 14:37:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 14:37:46,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 14:37:46,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:37:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 14:37:46,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:37:47,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 14:37:47,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:37:47,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625150097] [2022-01-31 14:37:47,151 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:37:47,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186611475] [2022-01-31 14:37:47,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186611475] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 14:37:47,151 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 14:37:47,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-01-31 14:37:47,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262952837] [2022-01-31 14:37:47,152 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 14:37:47,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 14:37:47,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:37:47,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 14:37:47,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-31 14:37:47,153 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-01-31 14:37:47,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:37:47,287 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-01-31 14:37:47,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 14:37:47,287 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-01-31 14:37:47,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:37:47,289 INFO L225 Difference]: With dead ends: 37 [2022-01-31 14:37:47,289 INFO L226 Difference]: Without dead ends: 34 [2022-01-31 14:37:47,289 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-01-31 14:37:47,290 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 14:37:47,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 112 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 14:37:47,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-31 14:37:47,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-01-31 14:37:47,294 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-01-31 14:37:47,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-01-31 14:37:47,295 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-01-31 14:37:47,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:37:47,295 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-01-31 14:37:47,296 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-01-31 14:37:47,296 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-01-31 14:37:47,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 14:37:47,296 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:37:47,296 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-01-31 14:37:47,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-31 14:37:47,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:37:47,511 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:37:47,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:37:47,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1668946595, now seen corresponding path program 1 times [2022-01-31 14:37:47,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:37:47,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230316416] [2022-01-31 14:37:47,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:37:47,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:37:47,521 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:37:47,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352840549] [2022-01-31 14:37:47,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:37:47,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:37:47,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:37:47,523 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:37:47,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-31 14:37:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 14:37:47,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 14:37:47,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:37:47,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 14:37:47,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:37:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 14:37:47,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:37:47,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230316416] [2022-01-31 14:37:47,729 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:37:47,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352840549] [2022-01-31 14:37:47,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352840549] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 14:37:47,729 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 14:37:47,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-01-31 14:37:47,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536888746] [2022-01-31 14:37:47,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 14:37:47,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 14:37:47,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:37:47,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 14:37:47,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-01-31 14:37:47,731 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-01-31 14:37:47,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:37:47,791 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-01-31 14:37:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 14:37:47,791 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-01-31 14:37:47,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:37:47,794 INFO L225 Difference]: With dead ends: 56 [2022-01-31 14:37:47,794 INFO L226 Difference]: Without dead ends: 56 [2022-01-31 14:37:47,795 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-01-31 14:37:47,796 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 39 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 14:37:47,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 94 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 14:37:47,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-31 14:37:47,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-01-31 14:37:47,815 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-01-31 14:37:47,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-01-31 14:37:47,818 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2022-01-31 14:37:47,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:37:47,818 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-01-31 14:37:47,819 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-01-31 14:37:47,819 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-01-31 14:37:47,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-31 14:37:47,820 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:37:47,820 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-01-31 14:37:47,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-31 14:37:48,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:37:48,021 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:37:48,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:37:48,022 INFO L85 PathProgramCache]: Analyzing trace with hash -906969448, now seen corresponding path program 2 times [2022-01-31 14:37:48,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:37:48,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841780765] [2022-01-31 14:37:48,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:37:48,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:37:48,035 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:37:48,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [950409312] [2022-01-31 14:37:48,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 14:37:48,036 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:37:48,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:37:48,043 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:37:48,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-31 14:37:48,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 14:37:48,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 14:37:48,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 14:37:48,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:37:48,266 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 14:37:48,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:37:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-01-31 14:37:48,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:37:48,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841780765] [2022-01-31 14:37:48,433 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:37:48,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950409312] [2022-01-31 14:37:48,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950409312] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 14:37:48,433 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 14:37:48,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-01-31 14:37:48,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861167369] [2022-01-31 14:37:48,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 14:37:48,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 14:37:48,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:37:48,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 14:37:48,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-01-31 14:37:48,435 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-01-31 14:37:48,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:37:48,585 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-01-31 14:37:48,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 14:37:48,586 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-01-31 14:37:48,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:37:48,587 INFO L225 Difference]: With dead ends: 110 [2022-01-31 14:37:48,587 INFO L226 Difference]: Without dead ends: 110 [2022-01-31 14:37:48,587 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-01-31 14:37:48,588 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 102 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 14:37:48,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 142 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 14:37:48,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-01-31 14:37:48,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-01-31 14:37:48,595 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-01-31 14:37:48,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-01-31 14:37:48,596 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 59 [2022-01-31 14:37:48,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:37:48,596 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-01-31 14:37:48,596 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-01-31 14:37:48,597 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-01-31 14:37:48,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-31 14:37:48,599 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:37:48,600 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-01-31 14:37:48,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-31 14:37:48,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:37:48,816 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:37:48,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:37:48,816 INFO L85 PathProgramCache]: Analyzing trace with hash 191644600, now seen corresponding path program 3 times [2022-01-31 14:37:48,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:37:48,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563155410] [2022-01-31 14:37:48,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:37:48,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:37:48,829 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:37:48,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [902722818] [2022-01-31 14:37:48,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 14:37:48,829 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:37:48,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:37:48,831 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:37:48,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-31 14:37:50,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-01-31 14:37:50,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 14:37:50,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-31 14:37:50,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:37:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 14:37:51,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:37:51,557 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-01-31 14:37:51,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:37:51,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563155410] [2022-01-31 14:37:51,558 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:37:51,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902722818] [2022-01-31 14:37:51,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902722818] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 14:37:51,558 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 14:37:51,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-01-31 14:37:51,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341248898] [2022-01-31 14:37:51,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 14:37:51,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 14:37:51,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:37:51,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 14:37:51,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-01-31 14:37:51,561 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-01-31 14:37:52,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:37:52,041 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2022-01-31 14:37:52,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-31 14:37:52,042 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-01-31 14:37:52,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:37:52,043 INFO L225 Difference]: With dead ends: 218 [2022-01-31 14:37:52,043 INFO L226 Difference]: Without dead ends: 218 [2022-01-31 14:37:52,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-01-31 14:37:52,045 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 335 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 14:37:52,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 238 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 14:37:52,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-01-31 14:37:52,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-01-31 14:37:52,056 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-01-31 14:37:52,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 241 transitions. [2022-01-31 14:37:52,058 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 241 transitions. Word has length 113 [2022-01-31 14:37:52,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:37:52,058 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 241 transitions. [2022-01-31 14:37:52,058 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-01-31 14:37:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions. [2022-01-31 14:37:52,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-01-31 14:37:52,061 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:37:52,062 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-01-31 14:37:52,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-31 14:37:52,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:37:52,268 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:37:52,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:37:52,269 INFO L85 PathProgramCache]: Analyzing trace with hash -698087944, now seen corresponding path program 4 times [2022-01-31 14:37:52,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:37:52,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992242509] [2022-01-31 14:37:52,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:37:52,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:37:52,290 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:37:52,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1990722282] [2022-01-31 14:37:52,291 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 14:37:52,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:37:52,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:37:52,292 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:37:52,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-31 14:37:52,533 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 14:37:52,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 14:37:52,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-31 14:37:52,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:37:53,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 2123 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 14:37:53,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:37:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 1199 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2022-01-31 14:37:54,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:37:54,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992242509] [2022-01-31 14:37:54,175 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:37:54,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990722282] [2022-01-31 14:37:54,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990722282] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 14:37:54,175 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 14:37:54,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-01-31 14:37:54,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80237537] [2022-01-31 14:37:54,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 14:37:54,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-01-31 14:37:54,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:37:54,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-01-31 14:37:54,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-01-31 14:37:54,179 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-01-31 14:37:55,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:37:55,458 INFO L93 Difference]: Finished difference Result 434 states and 481 transitions. [2022-01-31 14:37:55,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-01-31 14:37:55,458 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-01-31 14:37:55,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:37:55,461 INFO L225 Difference]: With dead ends: 434 [2022-01-31 14:37:55,461 INFO L226 Difference]: Without dead ends: 434 [2022-01-31 14:37:55,464 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-01-31 14:37:55,465 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 631 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 14:37:55,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 506 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 14:37:55,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-01-31 14:37:55,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2022-01-31 14:37:55,494 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-01-31 14:37:55,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 481 transitions. [2022-01-31 14:37:55,496 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 481 transitions. Word has length 221 [2022-01-31 14:37:55,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:37:55,497 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 481 transitions. [2022-01-31 14:37:55,497 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-01-31 14:37:55,497 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2022-01-31 14:37:55,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2022-01-31 14:37:55,508 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:37:55,509 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-01-31 14:37:55,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-31 14:37:55,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-01-31 14:37:55,723 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:37:55,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:37:55,724 INFO L85 PathProgramCache]: Analyzing trace with hash -619812232, now seen corresponding path program 5 times [2022-01-31 14:37:55,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:37:55,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583925828] [2022-01-31 14:37:55,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:37:55,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:37:55,757 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:37:55,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1984987600] [2022-01-31 14:37:55,759 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 14:37:55,759 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:37:55,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:37:55,767 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:37:55,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-31 14:37:57,999 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-01-31 14:37:58,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 14:37:58,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 97 conjunts are in the unsatisfiable core [2022-01-31 14:37:58,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 14:37:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 9407 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 14:37:59,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 14:38:00,496 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 5267 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2022-01-31 14:38:00,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 14:38:00,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583925828] [2022-01-31 14:38:00,497 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 14:38:00,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984987600] [2022-01-31 14:38:00,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984987600] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 14:38:00,497 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 14:38:00,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 54 [2022-01-31 14:38:00,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735381894] [2022-01-31 14:38:00,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 14:38:00,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-01-31 14:38:00,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 14:38:00,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-01-31 14:38:00,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-01-31 14:38:00,501 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-01-31 14:38:01,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 14:38:01,783 INFO L93 Difference]: Finished difference Result 470 states and 521 transitions. [2022-01-31 14:38:01,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-01-31 14:38:01,784 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-01-31 14:38:01,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 14:38:01,787 INFO L225 Difference]: With dead ends: 470 [2022-01-31 14:38:01,787 INFO L226 Difference]: Without dead ends: 470 [2022-01-31 14:38:01,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 922 GetRequests, 820 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2022-01-31 14:38:01,790 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 458 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 14:38:01,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [458 Valid, 474 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 14:38:01,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-01-31 14:38:01,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2022-01-31 14:38:01,800 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-01-31 14:38:01,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 521 transitions. [2022-01-31 14:38:01,801 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 521 transitions. Word has length 437 [2022-01-31 14:38:01,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 14:38:01,802 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 521 transitions. [2022-01-31 14:38:01,803 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-01-31 14:38:01,803 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 521 transitions. [2022-01-31 14:38:01,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2022-01-31 14:38:01,809 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 14:38:01,810 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-01-31 14:38:01,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-31 14:38:02,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:38:02,020 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 14:38:02,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 14:38:02,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1070552264, now seen corresponding path program 6 times [2022-01-31 14:38:02,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 14:38:02,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699131673] [2022-01-31 14:38:02,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 14:38:02,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 14:38:02,053 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 14:38:02,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1433700599] [2022-01-31 14:38:02,054 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 14:38:02,054 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 14:38:02,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 14:38:02,057 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 14:38:02,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-31 14:45:08,490 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2022-01-31 14:45:08,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-01-31 14:45:08,490 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-31 14:45:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-31 14:45:08,972 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-31 14:45:08,973 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-31 14:45:08,974 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 14:45:09,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-31 14:45:09,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-31 14:45:09,202 INFO L732 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2022-01-31 14:45:09,205 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 14:45:09,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 02:45:09 BasicIcfg [2022-01-31 14:45:09,355 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 14:45:09,356 INFO L158 Benchmark]: Toolchain (without parser) took 446972.52ms. Allocated memory was 176.2MB in the beginning and 268.4MB in the end (delta: 92.3MB). Free memory was 121.1MB in the beginning and 150.7MB in the end (delta: -29.7MB). Peak memory consumption was 63.4MB. Max. memory is 8.0GB. [2022-01-31 14:45:09,356 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 176.2MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 14:45:09,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.65ms. Allocated memory was 176.2MB in the beginning and 268.4MB in the end (delta: 92.3MB). Free memory was 120.8MB in the beginning and 241.7MB in the end (delta: -120.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-31 14:45:09,357 INFO L158 Benchmark]: Boogie Preprocessor took 41.76ms. Allocated memory is still 268.4MB. Free memory was 241.7MB in the beginning and 239.6MB in the end (delta: 2.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 14:45:09,357 INFO L158 Benchmark]: RCFGBuilder took 247.34ms. Allocated memory is still 268.4MB. Free memory was 239.6MB in the beginning and 227.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-31 14:45:09,357 INFO L158 Benchmark]: IcfgTransformer took 20.21ms. Allocated memory is still 268.4MB. Free memory was 227.5MB in the beginning and 226.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 14:45:09,358 INFO L158 Benchmark]: TraceAbstraction took 446439.39ms. Allocated memory is still 268.4MB. Free memory was 225.9MB in the beginning and 150.7MB in the end (delta: 75.2MB). Peak memory consumption was 76.3MB. Max. memory is 8.0GB. [2022-01-31 14:45:09,359 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 176.2MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.65ms. Allocated memory was 176.2MB in the beginning and 268.4MB in the end (delta: 92.3MB). Free memory was 120.8MB in the beginning and 241.7MB in the end (delta: -120.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.76ms. Allocated memory is still 268.4MB. Free memory was 241.7MB in the beginning and 239.6MB in the end (delta: 2.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 247.34ms. Allocated memory is still 268.4MB. Free memory was 239.6MB in the beginning and 227.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 20.21ms. Allocated memory is still 268.4MB. Free memory was 227.5MB in the beginning and 226.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 446439.39ms. Allocated memory is still 268.4MB. Free memory was 225.9MB in the beginning and 150.7MB in the end (delta: 75.2MB). Peak memory consumption was 76.3MB. 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: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [\old(counter)=52, counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(counter)=0, A=1567505, counter=0, R=1253] [L28] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L28] RET assume_abort_if_not(A % 2 == 1) VAL [\old(counter)=0, A=1567505, counter=0, R=1253] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [\old(counter)=0, A=1567505, counter=0, R=1253, r=2504, u=2507, v=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=1, counter++=0, R=1253, r=2504, u=2507, v=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=1, R=1253, r=2504, u=2507, v=1] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=1, R=1253, r=2504, u=2507, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=1, r=2503, R=1253, u=2507, v=3] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=2, counter++=1, r=2503, R=1253, u=2507, v=3] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=2, R=1253, r=2503, u=2507, v=3] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=2, R=1253, r=2503, u=2507, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=2, R=1253, r=2500, u=2507, v=5] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=3, counter++=2, R=1253, r=2500, u=2507, v=5] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=3, R=1253, r=2500, u=2507, v=5] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=3, R=1253, r=2500, u=2507, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=3, R=1253, r=2495, u=2507, v=7] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=4, counter++=3, R=1253, r=2495, u=2507, v=7] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=4, R=1253, r=2495, u=2507, v=7] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=4, r=2495, R=1253, u=2507, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=4, R=1253, r=2488, u=2507, v=9] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=5, counter++=4, R=1253, r=2488, u=2507, v=9] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=5, R=1253, r=2488, u=2507, v=9] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=5, r=2488, R=1253, u=2507, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=5, r=2479, R=1253, u=2507, v=11] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=6, counter++=5, r=2479, R=1253, u=2507, v=11] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=6, R=1253, r=2479, u=2507, v=11] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=6, r=2479, R=1253, u=2507, v=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=6, R=1253, r=2468, u=2507, v=13] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=7, counter++=6, R=1253, r=2468, u=2507, v=13] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=7, r=2468, R=1253, u=2507, v=13] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=7, R=1253, r=2468, u=2507, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=7, r=2455, R=1253, u=2507, v=15] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=8, counter++=7, R=1253, r=2455, u=2507, v=15] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=8, r=2455, R=1253, u=2507, v=15] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=8, R=1253, r=2455, u=2507, v=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=8, R=1253, r=2440, u=2507, v=17] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=9, counter++=8, R=1253, r=2440, u=2507, v=17] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=9, R=1253, r=2440, u=2507, v=17] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=9, r=2440, R=1253, u=2507, v=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=9, R=1253, r=2423, u=2507, v=19] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=10, counter++=9, r=2423, R=1253, u=2507, v=19] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=10, R=1253, r=2423, u=2507, v=19] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=10, r=2423, R=1253, u=2507, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=10, R=1253, r=2404, u=2507, v=21] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=11, counter++=10, r=2404, R=1253, u=2507, v=21] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=11, r=2404, R=1253, u=2507, v=21] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=11, r=2404, R=1253, u=2507, v=21] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=11, R=1253, r=2383, u=2507, v=23] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=12, counter++=11, R=1253, r=2383, u=2507, v=23] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=12, r=2383, R=1253, u=2507, v=23] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=12, R=1253, r=2383, u=2507, v=23] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=12, R=1253, r=2360, u=2507, v=25] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=13, counter++=12, R=1253, r=2360, u=2507, v=25] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=13, r=2360, R=1253, u=2507, v=25] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=13, r=2360, R=1253, u=2507, v=25] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=13, r=2335, R=1253, u=2507, v=27] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=14, counter++=13, R=1253, r=2335, u=2507, v=27] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=14, r=2335, R=1253, u=2507, v=27] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=14, R=1253, r=2335, u=2507, v=27] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=14, r=2308, R=1253, u=2507, v=29] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=15, counter++=14, R=1253, r=2308, u=2507, v=29] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=15, r=2308, R=1253, u=2507, v=29] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=15, R=1253, r=2308, u=2507, v=29] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=15, R=1253, r=2279, u=2507, v=31] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=16, counter++=15, R=1253, r=2279, u=2507, v=31] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=16, R=1253, r=2279, u=2507, v=31] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=16, R=1253, r=2279, u=2507, v=31] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=16, R=1253, r=2248, u=2507, v=33] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=17, counter++=16, R=1253, r=2248, u=2507, v=33] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=17, R=1253, r=2248, u=2507, v=33] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=17, R=1253, r=2248, u=2507, v=33] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=17, R=1253, r=2215, u=2507, v=35] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=18, counter++=17, r=2215, R=1253, u=2507, v=35] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=18, R=1253, r=2215, u=2507, v=35] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=18, R=1253, r=2215, u=2507, v=35] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=18, R=1253, r=2180, u=2507, v=37] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=19, counter++=18, r=2180, R=1253, u=2507, v=37] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=19, R=1253, r=2180, u=2507, v=37] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=19, r=2180, R=1253, u=2507, v=37] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=19, r=2143, R=1253, u=2507, v=39] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=20, counter++=19, R=1253, r=2143, u=2507, v=39] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=20, R=1253, r=2143, u=2507, v=39] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=20, R=1253, r=2143, u=2507, v=39] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=20, r=2104, R=1253, u=2507, v=41] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=21, counter++=20, r=2104, R=1253, u=2507, v=41] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=21, R=1253, r=2104, u=2507, v=41] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=21, R=1253, r=2104, u=2507, v=41] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=21, R=1253, r=2063, u=2507, v=43] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=22, counter++=21, R=1253, r=2063, u=2507, v=43] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=22, R=1253, r=2063, u=2507, v=43] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=22, r=2063, R=1253, u=2507, v=43] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=22, R=1253, r=2020, u=2507, v=45] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=23, counter++=22, R=1253, r=2020, u=2507, v=45] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=23, R=1253, r=2020, u=2507, v=45] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=23, r=2020, R=1253, u=2507, v=45] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=23, R=1253, r=1975, u=2507, v=47] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=24, counter++=23, r=1975, R=1253, u=2507, v=47] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=24] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=24] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=24, R=1253, r=1975, u=2507, v=47] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=24, r=1975, R=1253, u=2507, v=47] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=24, r=1928, R=1253, u=2507, v=49] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=25, counter++=24, R=1253, r=1928, u=2507, v=49] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=25, R=1253, r=1928, u=2507, v=49] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=25, R=1253, r=1928, u=2507, v=49] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=25, R=1253, r=1879, u=2507, v=51] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=26, counter++=25, r=1879, R=1253, u=2507, v=51] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=26, r=1879, R=1253, u=2507, v=51] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=26, r=1879, R=1253, u=2507, v=51] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=26, r=1828, R=1253, u=2507, v=53] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=27, counter++=26, r=1828, R=1253, u=2507, v=53] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=27] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=27] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=27, R=1253, r=1828, u=2507, v=53] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=27, R=1253, r=1828, u=2507, v=53] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=27, r=1775, R=1253, u=2507, v=55] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=28, counter++=27, r=1775, R=1253, u=2507, v=55] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=28, R=1253, r=1775, u=2507, v=55] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=28, R=1253, r=1775, u=2507, v=55] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=28, r=1720, R=1253, u=2507, v=57] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=29, counter++=28, R=1253, r=1720, u=2507, v=57] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=29, r=1720, R=1253, u=2507, v=57] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=29, R=1253, r=1720, u=2507, v=57] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=29, R=1253, r=1663, u=2507, v=59] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=30, counter++=29, R=1253, r=1663, u=2507, v=59] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=30] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=30] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=30, r=1663, R=1253, u=2507, v=59] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=30, R=1253, r=1663, u=2507, v=59] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=30, R=1253, r=1604, u=2507, v=61] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=31, counter++=30, R=1253, r=1604, u=2507, v=61] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=31, r=1604, R=1253, u=2507, v=61] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=31, R=1253, r=1604, u=2507, v=61] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=31, r=1543, R=1253, u=2507, v=63] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=32, counter++=31, R=1253, r=1543, u=2507, v=63] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=32, r=1543, R=1253, u=2507, v=63] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=32, r=1543, R=1253, u=2507, v=63] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=32, R=1253, r=1480, u=2507, v=65] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=33, counter++=32, r=1480, R=1253, u=2507, v=65] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=33, r=1480, R=1253, u=2507, v=65] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=33, r=1480, R=1253, u=2507, v=65] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=33, r=1415, R=1253, u=2507, v=67] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=34, counter++=33, R=1253, r=1415, u=2507, v=67] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=34, R=1253, r=1415, u=2507, v=67] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=34, r=1415, R=1253, u=2507, v=67] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=34, R=1253, r=1348, u=2507, v=69] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=35, counter++=34, R=1253, r=1348, u=2507, v=69] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=35, r=1348, R=1253, u=2507, v=69] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=35, R=1253, r=1348, u=2507, v=69] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=35, R=1253, r=1279, u=2507, v=71] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=36, counter++=35, r=1279, R=1253, u=2507, v=71] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=36] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=36] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=36, R=1253, r=1279, u=2507, v=71] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=36, R=1253, r=1279, u=2507, v=71] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=36, R=1253, r=1208, u=2507, v=73] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=37, counter++=36, r=1208, R=1253, u=2507, v=73] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=37, R=1253, r=1208, u=2507, v=73] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=37, r=1208, R=1253, u=2507, v=73] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=37, r=1135, R=1253, u=2507, v=75] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=38, counter++=37, r=1135, R=1253, u=2507, v=75] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=38, R=1253, r=1135, u=2507, v=75] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=38, r=1135, R=1253, u=2507, v=75] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=38, R=1253, r=1060, u=2507, v=77] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=39, counter++=38, R=1253, r=1060, u=2507, v=77] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=39] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=39] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=39, r=1060, R=1253, u=2507, v=77] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=39, r=1060, R=1253, u=2507, v=77] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=39, r=983, R=1253, u=2507, v=79] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=40, counter++=39, R=1253, r=983, u=2507, v=79] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=40, R=1253, r=983, u=2507, v=79] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=40, R=1253, r=983, u=2507, v=79] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=40, r=904, R=1253, u=2507, v=81] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=41, counter++=40, R=1253, r=904, u=2507, v=81] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=41, r=904, R=1253, u=2507, v=81] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=41, R=1253, r=904, u=2507, v=81] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=41, R=1253, r=823, u=2507, v=83] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=42, counter++=41, r=823, R=1253, u=2507, v=83] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=42] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=42] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=42, R=1253, r=823, u=2507, v=83] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=42, R=1253, r=823, u=2507, v=83] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=42, R=1253, r=740, u=2507, v=85] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=43, counter++=42, r=740, R=1253, u=2507, v=85] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=43, R=1253, r=740, u=2507, v=85] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=43, r=740, R=1253, u=2507, v=85] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=43, R=1253, r=655, u=2507, v=87] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=44, counter++=43, r=655, R=1253, u=2507, v=87] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=44, R=1253, r=655, u=2507, v=87] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=44, r=655, R=1253, u=2507, v=87] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=44, R=1253, r=568, u=2507, v=89] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=45, counter++=44, R=1253, r=568, u=2507, v=89] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=45, R=1253, r=568, u=2507, v=89] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=45, r=568, R=1253, u=2507, v=89] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=45, R=1253, r=479, u=2507, v=91] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=46, counter++=45, R=1253, r=479, u=2507, v=91] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=46, r=479, R=1253, u=2507, v=91] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=46, R=1253, r=479, u=2507, v=91] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=46, r=388, R=1253, u=2507, v=93] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=47, counter++=46, r=388, R=1253, u=2507, v=93] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=47, R=1253, r=388, u=2507, v=93] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=47, R=1253, r=388, u=2507, v=93] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=47, r=295, R=1253, u=2507, v=95] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=48, counter++=47, R=1253, r=295, u=2507, v=95] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=48] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=48] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=48, R=1253, r=295, u=2507, v=95] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=48, R=1253, r=295, u=2507, v=95] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=48, r=200, R=1253, u=2507, v=97] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=49, counter++=48, r=200, R=1253, u=2507, v=97] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=49, R=1253, r=200, u=2507, v=97] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=49, r=200, R=1253, u=2507, v=97] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=49, r=103, R=1253, u=2507, v=99] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=50, counter++=49, r=103, R=1253, u=2507, v=99] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=50, R=1253, r=103, u=2507, v=99] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=50, R=1253, r=103, u=2507, v=99] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=50, r=4, R=1253, u=2507, v=101] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=51, counter++=50, r=4, R=1253, u=2507, v=101] [L34] COND FALSE !(counter++<50) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, \old(counter)=0, counter=51] [L12] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] [L14] 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: 446.2s, OverallIterations: 10, TraceHistogramMax: 51, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1596 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1595 mSDsluCounter, 1755 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1393 mSDsCounter, 528 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 858 IncrementalHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 528 mSolverCounterUnsat, 362 mSDtfsCounter, 858 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1972 GetRequests, 1684 SyntacticMatches, 2 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2921 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=470occurred in iteration=9, InterpolantAutomatonStates: 293, 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, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 431.0s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 1432 NumberOfCodeBlocks, 1432 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 1835 ConstructedInterpolants, 0 QuantifiedInterpolants, 4655 SizeOfPredicates, 98 NumberOfNonLiveVariables, 2504 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-01-31 14:45:09,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...