/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-15 02:27:08,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 02:27:08,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 02:27:08,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 02:27:08,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 02:27:08,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 02:27:08,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 02:27:08,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 02:27:09,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 02:27:09,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 02:27:09,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 02:27:09,001 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 02:27:09,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 02:27:09,002 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 02:27:09,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 02:27:09,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 02:27:09,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 02:27:09,005 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 02:27:09,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 02:27:09,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 02:27:09,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 02:27:09,014 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 02:27:09,015 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 02:27:09,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 02:27:09,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 02:27:09,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 02:27:09,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 02:27:09,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 02:27:09,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 02:27:09,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 02:27:09,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 02:27:09,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 02:27:09,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 02:27:09,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 02:27:09,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 02:27:09,021 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 02:27:09,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 02:27:09,022 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 02:27:09,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 02:27:09,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 02:27:09,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 02:27:09,024 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-02-15 02:27:09,035 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 02:27:09,035 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 02:27:09,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 02:27:09,036 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 02:27:09,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 02:27:09,037 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 02:27:09,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 02:27:09,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 02:27:09,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 02:27:09,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 02:27:09,037 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 02:27:09,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 02:27:09,037 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 02:27:09,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 02:27:09,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 02:27:09,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 02:27:09,038 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 02:27:09,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 02:27:09,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 02:27:09,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 02:27:09,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-15 02:27:09,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-15 02:27:09,039 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-02-15 02:27:09,039 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-02-15 02:27:09,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 02:27:09,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 02:27:09,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 02:27:09,248 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 02:27:09,259 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 02:27:09,260 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound1.c [2022-02-15 02:27:09,307 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7da0653e0/e7af5a4ae8b04974b21e9f6cbad31cbb/FLAGf481b5d54 [2022-02-15 02:27:09,629 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 02:27:09,630 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound1.c [2022-02-15 02:27:09,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7da0653e0/e7af5a4ae8b04974b21e9f6cbad31cbb/FLAGf481b5d54 [2022-02-15 02:27:09,643 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7da0653e0/e7af5a4ae8b04974b21e9f6cbad31cbb [2022-02-15 02:27:09,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 02:27:09,646 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-15 02:27:09,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 02:27:09,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 02:27:09,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 02:27:09,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:27:09" (1/1) ... [2022-02-15 02:27:09,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1312c394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:27:09, skipping insertion in model container [2022-02-15 02:27:09,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:27:09" (1/1) ... [2022-02-15 02:27:09,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 02:27:09,670 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 02:27:09,818 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/dijkstra-u_valuebound1.c[525,538] [2022-02-15 02:27:09,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 02:27:09,859 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 02:27:09,866 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/dijkstra-u_valuebound1.c[525,538] [2022-02-15 02:27:09,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 02:27:09,882 INFO L208 MainTranslator]: Completed translation [2022-02-15 02:27:09,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:27:09 WrapperNode [2022-02-15 02:27:09,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 02:27:09,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 02:27:09,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 02:27:09,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 02:27:09,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:27:09" (1/1) ... [2022-02-15 02:27:09,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:27:09" (1/1) ... [2022-02-15 02:27:09,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:27:09" (1/1) ... [2022-02-15 02:27:09,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:27:09" (1/1) ... [2022-02-15 02:27:09,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:27:09" (1/1) ... [2022-02-15 02:27:09,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:27:09" (1/1) ... [2022-02-15 02:27:09,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:27:09" (1/1) ... [2022-02-15 02:27:09,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 02:27:09,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 02:27:09,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 02:27:09,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 02:27:09,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:27:09" (1/1) ... [2022-02-15 02:27:09,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 02:27:09,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 02:27:09,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-15 02:27:09,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-15 02:27:09,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 02:27:09,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 02:27:09,996 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 02:27:09,996 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-15 02:27:09,997 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-15 02:27:09,997 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 02:27:09,998 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 02:27:09,998 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 02:27:09,998 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 02:27:09,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 02:27:09,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-02-15 02:27:09,998 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-15 02:27:09,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-15 02:27:09,999 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 02:27:09,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 02:27:10,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 02:27:10,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 02:27:10,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 02:27:10,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 02:27:10,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 02:27:10,050 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 02:27:10,052 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 02:27:10,227 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 02:27:10,240 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 02:27:10,241 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-15 02:27:10,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:27:10 BoogieIcfgContainer [2022-02-15 02:27:10,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 02:27:10,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 02:27:10,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 02:27:10,247 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 02:27:10,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 02:27:09" (1/3) ... [2022-02-15 02:27:10,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9a965a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 02:27:10, skipping insertion in model container [2022-02-15 02:27:10,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:27:09" (2/3) ... [2022-02-15 02:27:10,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9a965a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 02:27:10, skipping insertion in model container [2022-02-15 02:27:10,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:27:10" (3/3) ... [2022-02-15 02:27:10,249 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound1.c [2022-02-15 02:27:10,252 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-15 02:27:10,253 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 02:27:10,290 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 02:27:10,298 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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=JORDAN [2022-02-15 02:27:10,299 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-15 02:27:10,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-15 02:27:10,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-15 02:27:10,324 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:27:10,325 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:27:10,325 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:27:10,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:27:10,330 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 1 times [2022-02-15 02:27:10,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:27:10,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [729912188] [2022-02-15 02:27:10,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:27:10,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:27:10,380 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:27:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:10,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:27:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:10,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:27:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:10,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:27:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:10,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-15 02:27:10,532 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:27:10,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [729912188] [2022-02-15 02:27:10,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [729912188] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:27:10,534 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:27:10,534 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-15 02:27:10,535 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840873439] [2022-02-15 02:27:10,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:27:10,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-15 02:27:10,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:27:10,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-15 02:27:10,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-15 02:27:10,559 INFO L87 Difference]: Start difference. First operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-15 02:27:12,653 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:12,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:27:12,731 INFO L93 Difference]: Finished difference Result 69 states and 113 transitions. [2022-02-15 02:27:12,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-15 02:27:12,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-02-15 02:27:12,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:27:12,737 INFO L225 Difference]: With dead ends: 69 [2022-02-15 02:27:12,738 INFO L226 Difference]: Without dead ends: 33 [2022-02-15 02:27:12,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-15 02:27:12,745 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-15 02:27:12,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-02-15 02:27:12,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-15 02:27:12,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-15 02:27:12,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-15 02:27:12,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-02-15 02:27:12,791 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2022-02-15 02:27:12,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:27:12,791 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-02-15 02:27:12,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-15 02:27:12,792 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-02-15 02:27:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-15 02:27:12,793 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:27:12,793 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, 1] [2022-02-15 02:27:12,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 02:27:12,794 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:27:12,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:27:12,795 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 1 times [2022-02-15 02:27:12,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:27:12,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1492677800] [2022-02-15 02:27:12,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:27:12,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:27:12,801 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:27:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:13,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:27:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:13,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:27:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:13,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:27:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:13,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-15 02:27:13,074 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:27:13,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1492677800] [2022-02-15 02:27:13,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1492677800] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:27:13,074 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:27:13,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 02:27:13,075 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108012034] [2022-02-15 02:27:13,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:27:13,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 02:27:13,075 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:27:13,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 02:27:13,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-15 02:27:13,076 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 02:27:15,282 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:17,286 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:19,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:23,730 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-02-15 02:27:25,732 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-02-15 02:27:27,735 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-02-15 02:27:29,774 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:31,822 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:27:31,882 INFO L93 Difference]: Finished difference Result 67 states and 97 transitions. [2022-02-15 02:27:31,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 02:27:31,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 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 24 [2022-02-15 02:27:31,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:27:31,885 INFO L225 Difference]: With dead ends: 67 [2022-02-15 02:27:31,885 INFO L226 Difference]: Without dead ends: 49 [2022-02-15 02:27:31,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-15 02:27:31,886 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 42 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2022-02-15 02:27:31,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 57 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 199 Invalid, 8 Unknown, 0 Unchecked, 18.7s Time] [2022-02-15 02:27:31,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-02-15 02:27:31,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-02-15 02:27:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-15 02:27:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-02-15 02:27:31,899 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 24 [2022-02-15 02:27:31,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:27:31,899 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-02-15 02:27:31,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 02:27:31,899 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-02-15 02:27:31,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-15 02:27:31,900 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:27:31,900 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] [2022-02-15 02:27:31,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 02:27:31,900 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:27:31,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:27:31,901 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 1 times [2022-02-15 02:27:31,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:27:31,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [300918645] [2022-02-15 02:27:31,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:27:31,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:27:31,903 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:27:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:32,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:27:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:32,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:27:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:32,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:27:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-15 02:27:32,165 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:27:32,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [300918645] [2022-02-15 02:27:32,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [300918645] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:27:32,166 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:27:32,166 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 02:27:32,166 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568663360] [2022-02-15 02:27:32,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:27:32,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 02:27:32,166 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:27:32,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 02:27:32,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-15 02:27:32,167 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 02:27:33,664 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:35,679 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:36,811 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:43,579 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:45,649 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:47,720 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:49,802 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-02-15 02:27:51,851 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:27:52,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:27:52,112 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2022-02-15 02:27:52,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 02:27:52,112 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 3 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 26 [2022-02-15 02:27:52,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:27:52,114 INFO L225 Difference]: With dead ends: 70 [2022-02-15 02:27:52,114 INFO L226 Difference]: Without dead ends: 66 [2022-02-15 02:27:52,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-02-15 02:27:52,115 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 41 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 66 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.8s IncrementalHoareTripleChecker+Time [2022-02-15 02:27:52,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 61 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 231 Invalid, 6 Unknown, 0 Unchecked, 19.8s Time] [2022-02-15 02:27:52,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-15 02:27:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-02-15 02:27:52,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 35 states have internal predecessors, (40), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-02-15 02:27:52,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 89 transitions. [2022-02-15 02:27:52,142 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 89 transitions. Word has length 26 [2022-02-15 02:27:52,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:27:52,142 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 89 transitions. [2022-02-15 02:27:52,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 02:27:52,142 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2022-02-15 02:27:52,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-15 02:27:52,143 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:27:52,143 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:27:52,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 02:27:52,144 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:27:52,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:27:52,144 INFO L85 PathProgramCache]: Analyzing trace with hash -148039962, now seen corresponding path program 2 times [2022-02-15 02:27:52,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:27:52,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1563677123] [2022-02-15 02:27:52,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:27:52,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:27:52,152 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:27:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:52,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:27:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:52,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:27:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:52,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:27:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:27:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-15 02:27:52,374 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:27:52,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1563677123] [2022-02-15 02:27:52,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1563677123] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:27:52,374 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:27:52,374 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 02:27:52,374 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526619896] [2022-02-15 02:27:52,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:27:52,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 02:27:52,375 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:27:52,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 02:27:52,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-15 02:27:52,375 INFO L87 Difference]: Start difference. First operand 66 states and 89 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 02:27:55,986 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-02-15 02:27:58,206 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:28:00,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:28:03,275 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:28:06,146 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:28:08,270 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:28:10,394 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-02-15 02:28:12,398 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-02-15 02:28:14,401 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-02-15 02:28:14,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:28:14,736 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2022-02-15 02:28:14,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 02:28:14,737 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 3 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 28 [2022-02-15 02:28:14,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:28:14,738 INFO L225 Difference]: With dead ends: 89 [2022-02-15 02:28:14,738 INFO L226 Difference]: Without dead ends: 80 [2022-02-15 02:28:14,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-02-15 02:28:14,741 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 48 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 100 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2022-02-15 02:28:14,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 71 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 274 Invalid, 9 Unknown, 0 Unchecked, 22.2s Time] [2022-02-15 02:28:14,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-02-15 02:28:14,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-02-15 02:28:14,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 40 states have (on average 1.2) internal successors, (48), 42 states have internal predecessors, (48), 32 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-15 02:28:14,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 109 transitions. [2022-02-15 02:28:14,755 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 109 transitions. Word has length 28 [2022-02-15 02:28:14,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:28:14,755 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 109 transitions. [2022-02-15 02:28:14,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 02:28:14,755 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 109 transitions. [2022-02-15 02:28:14,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-15 02:28:14,756 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:28:14,756 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:28:14,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 02:28:14,756 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:28:14,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:28:14,756 INFO L85 PathProgramCache]: Analyzing trace with hash -79413119, now seen corresponding path program 3 times [2022-02-15 02:28:14,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:28:14,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1825201516] [2022-02-15 02:28:14,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:28:14,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:28:14,758 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:28:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:28:14,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:28:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:28:14,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:28:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:28:14,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-15 02:28:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:28:14,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-15 02:28:14,990 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:28:14,990 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1825201516] [2022-02-15 02:28:14,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1825201516] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:28:14,991 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:28:14,991 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 02:28:14,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954994260] [2022-02-15 02:28:14,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:28:14,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 02:28:14,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:28:14,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 02:28:14,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-02-15 02:28:14,992 INFO L87 Difference]: Start difference. First operand 80 states and 109 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 02:28:19,536 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:28:22,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:28:29,936 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-02-15 02:28:31,977 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:28:34,091 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-15 02:28:34,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:28:34,304 INFO L93 Difference]: Finished difference Result 102 states and 140 transitions. [2022-02-15 02:28:34,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-15 02:28:34,304 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (5), 3 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 30 [2022-02-15 02:28:34,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:28:34,306 INFO L225 Difference]: With dead ends: 102 [2022-02-15 02:28:34,306 INFO L226 Difference]: Without dead ends: 95 [2022-02-15 02:28:34,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-02-15 02:28:34,307 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 48 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 130 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2022-02-15 02:28:34,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 93 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 518 Invalid, 4 Unknown, 0 Unchecked, 19.0s Time] [2022-02-15 02:28:34,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-15 02:28:34,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 80. [2022-02-15 02:28:34,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 43 states have internal predecessors, (49), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-15 02:28:34,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 109 transitions. [2022-02-15 02:28:34,321 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 109 transitions. Word has length 30 [2022-02-15 02:28:34,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:28:34,321 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 109 transitions. [2022-02-15 02:28:34,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 02:28:34,321 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 109 transitions. [2022-02-15 02:28:34,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-15 02:28:34,322 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:28:34,322 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:28:34,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 02:28:34,322 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:28:34,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:28:34,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 1 times [2022-02-15 02:28:34,323 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:28:34,323 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [228712378] [2022-02-15 02:28:34,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:28:34,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:28:34,324 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:28:34,330 WARN L132 FreeRefinementEngine]: Strategy FIXED_PREFERENCES was unsuccessful and could not determine trace feasibility [2022-02-15 02:28:34,331 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2022-02-15 02:28:34,335 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-15 02:28:34,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 02:28:34,338 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2022-02-15 02:28:34,339 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 02:28:34,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 02:28:34 BoogieIcfgContainer [2022-02-15 02:28:34,346 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 02:28:34,346 INFO L158 Benchmark]: Toolchain (without parser) took 84700.69ms. Allocated memory was 189.8MB in the beginning and 259.0MB in the end (delta: 69.2MB). Free memory was 137.0MB in the beginning and 177.7MB in the end (delta: -40.7MB). Peak memory consumption was 30.0MB. Max. memory is 8.0GB. [2022-02-15 02:28:34,346 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 02:28:34,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.20ms. Allocated memory is still 189.8MB. Free memory was 136.9MB in the beginning and 161.0MB in the end (delta: -24.1MB). Peak memory consumption was 14.3MB. Max. memory is 8.0GB. [2022-02-15 02:28:34,347 INFO L158 Benchmark]: Boogie Preprocessor took 33.97ms. Allocated memory is still 189.8MB. Free memory was 161.0MB in the beginning and 159.3MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-15 02:28:34,347 INFO L158 Benchmark]: RCFGBuilder took 315.59ms. Allocated memory is still 189.8MB. Free memory was 159.3MB in the beginning and 147.1MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-02-15 02:28:34,347 INFO L158 Benchmark]: TraceAbstraction took 84102.68ms. Allocated memory was 189.8MB in the beginning and 259.0MB in the end (delta: 69.2MB). Free memory was 146.4MB in the beginning and 177.7MB in the end (delta: -31.3MB). Peak memory consumption was 38.7MB. Max. memory is 8.0GB. [2022-02-15 02:28:34,348 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.20ms. Allocated memory is still 189.8MB. Free memory was 136.9MB in the beginning and 161.0MB in the end (delta: -24.1MB). Peak memory consumption was 14.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.97ms. Allocated memory is still 189.8MB. Free memory was 161.0MB in the beginning and 159.3MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 315.59ms. Allocated memory is still 189.8MB. Free memory was 159.3MB in the beginning and 147.1MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 84102.68ms. Allocated memory was 189.8MB in the beginning and 259.0MB in the end (delta: 69.2MB). Free memory was 146.4MB in the beginning and 177.7MB in the end (delta: -31.3MB). Peak memory consumption was 38.7MB. 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 - UnprovableResult [Line: 14]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L20] unsigned int n, p, q, r, h; [L22] n = __VERIFIER_nondet_uint() [L23] CALL assume_abort_if_not(n>=0 && n<=1) [L9] COND FALSE !(!cond) [L23] RET assume_abort_if_not(n>=0 && n<=1) [L24] CALL assume_abort_if_not(n < 4294967295 / 4) [L9] COND FALSE !(!cond) [L24] RET assume_abort_if_not(n < 4294967295 / 4) [L26] p = 0 [L27] q = 1 [L28] r = n [L29] h = 0 [L30] COND TRUE 1 [L31] COND TRUE !(q <= n) [L38] COND TRUE 1 [L39] CALL __VERIFIER_assert(r < 2 * p + q) [L12] COND FALSE !(!(cond)) [L39] RET __VERIFIER_assert(r < 2 * p + q) [L40] CALL __VERIFIER_assert(p*p + r*q == n*q) [L12] COND FALSE !(!(cond)) [L40] RET __VERIFIER_assert(p*p + r*q == n*q) [L41] CALL __VERIFIER_assert(h * h * h - 12 * h * n * q + 16 * n * p * q - h * q * q - 4 * p * q * q + 12 * h * q * r - 16 * p * q * r == 0) [L12] COND TRUE !(cond) [L14] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 84.1s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 82.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 28 mSolverCounterUnknown, 236 SdHoareTripleChecker+Valid, 81.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 324 SdHoareTripleChecker+Invalid, 80.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125 mSDsCounter, 351 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1233 IncrementalHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 351 mSolverCounterUnsat, 199 mSDtfsCounter, 1233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=4, InterpolantAutomatonStates: 47, 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, 5 MinimizatonAttempts, 17 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 could not prove your program: unable to determine feasibility of some traces [2022-02-15 02:28:34,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...